Pages that link to "Item:Q3100694"
From MaRDI portal
The following pages link to Minimax regret path location on trees (Q3100694):
Displaying 18 items.
- Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks (Q496433) (← links)
- On the minmax regret path center problem on trees (Q777269) (← links)
- A note on the minmax regret centdian location on trees (Q935247) (← links)
- A quadratic time exact algorithm for continuous connected 2-facility location problem in trees (Q1631680) (← links)
- Extensive facility location problems on networks: an updated review (Q1667394) (← links)
- An improved algorithm for the minmax regret path centdian problem on trees (Q1672003) (← links)
- Interval data minmax regret network optimization problems (Q1827805) (← links)
- Efficient algorithms for the minmax regret path center problem with length constraint on trees (Q2136270) (← links)
- An improved algorithm for the minmax regret path center problem on trees (Q2194857) (← links)
- Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities (Q2319636) (← links)
- Reliability problems in multiple path-shaped facility location on networks (Q2339811) (← links)
- On the minmax regret path median problem on trees (Q2353396) (← links)
- New approaches to the robust 1-center location problems on tree networks (Q2678831) (← links)
- Path Minima in Incremental Unrooted Trees (Q3541117) (← links)
- Minimax regret p-center location on a network with demand uncertainty (Q4228787) (← links)
- Robust mean absolute deviation problems on networks with linear vertex weights (Q5326780) (← links)
- Comments on: ``Extensive facility location problems on networks: an updated review'' (Q5970233) (← links)
- The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights (Q6053538) (← links)
