Pages that link to "Item:Q4922120"
From MaRDI portal
The following pages link to Minimax Regret 1-Sink Location Problems in Dynamic Path Networks (Q4922120):
Displayed 13 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 for sink location on dynamic flow paths with general capacities (Q2133396) (← 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)
- Minimax regret 1-sink location problem in dynamic path networks (Q2348257) (← links)
- (Q5091004) (← links)
- Minimax regret vertex 2-sink location problem in dynamic path networks (Q5963611) (← links)