Pages that link to "Item:Q621687"
From MaRDI portal
The following pages link to The minmax regret gradual covering location problem on a network with incomplete information of demand weights (Q621687):
Displaying 10 items.
- A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty (Q322691) (← links)
- Continuous space maximal coverage: insights, advances and challenges (Q337677) (← links)
- Scenario based robust line balancing: Computational complexity (Q442208) (← links)
- A new approach to optimize a hub covering location problem with a queue estimation component using genetic programming (Q1797769) (← links)
- Capacitated multi-period maximal covering location problem with server uncertainty (Q2029288) (← links)
- Robust min-max regret covering problems (Q2162527) (← links)
- The minimal covering location and sizing problem in the presence of gradual cooperative coverage (Q2242372) (← links)
- Minmax regret maximal covering location problems with edge demands (Q2668649) (← links)
- Upgrading edges in the maximal covering location problem (Q2673553) (← links)
- Improving emergency services efficiency during Islamic pilgrimage through optimal allocation of facilities (Q6092512) (← links)