Pages that link to "Item:Q896121"
From MaRDI portal
The following pages link to Improved algorithms for computing minmax regret sinks on dynamic path and tree networks (Q896121):
Displaying 15 items.
- Minimax regret 1-sink location problem with accessibility in dynamic general networks (Q322462) (← links)
- A linear time algorithm for computing minmax regret 1-median on a tree network (Q486974) (← links)
- Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks (Q496433) (← links)
- Multiple sink location problem in path networks with a combinational objective (Q828700) (← links)
- Minmax regret for sink location on dynamic flow paths with general capacities (Q2133396) (← links)
- Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights (Q2232232) (← links)
- Minsum \(k\)-sink problem on path networks (Q2285143) (← links)
- Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities (Q2319636) (← links)
- Improved Algorithms for Computing Minmax Regret 1-Sink and 2-Sink on Path Network (Q2942389) (← links)
- (Q5091004) (← links)
- A TREE PARTITIONING PROBLEM ARISING FROM AN EVACUATION PROBLEM IN TREE DYNAMIC NETWORKS (Q5471480) (← links)
- Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity (Q5746252) (← links)
- Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows (Q6107888) (← links)
- Capacity provisioning for evacuation on path networks (Q6179704) (← links)
- Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights (Q6621860) (← links)
