Pages that link to "Item:Q5746252"
From MaRDI portal
The following pages link to Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity (Q5746252):
Displayed 10 items.
- Minmax regret 1-facility location on uncertain path networks (Q297369) (← links)
- Minimax regret 1-sink location problem with accessibility in dynamic general networks (Q322462) (← links)
- Minimax regret 1-sink location problem in dynamic cycle networks (Q477612) (← links)
- Minimax regret 1-median problem in dynamic path networks (Q726099) (← links)
- Multiple sink location problem in path networks with a combinational objective (Q828700) (← links)
- Improved algorithms for computing minmax regret sinks on dynamic path and tree networks (Q896121) (← links)
- Multiple sink location problems in dynamic path networks (Q897956) (← links)
- Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities (Q2319636) (← 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)