Pages that link to "Item:Q1569932"
From MaRDI portal
The following pages link to Algorithms for the robust 1-center problem on a tree (Q1569932):
Displayed 8 items.
- Flexible-attribute problems (Q616800) (← links)
- The minmax regret gradual covering location problem on a network with incomplete information of demand weights (Q621687) (← links)
- Minmax regret location--allocation problem on a network under uncertainty (Q864020) (← links)
- A note on the minmax regret centdian location on trees (Q935247) (← links)
- Two-stage flexible-choice problems under uncertainty (Q1037661) (← links)
- Facility location problems with uncertainty on the plane (Q1779686) (← links)
- Complexity of robust single facility location problems on networks with uncertain edge lengths. (Q1811071) (← links)
- The backup 2‐center and backup 2‐median problems on trees (Q5191127) (← links)