Pages that link to "Item:Q864020"
From MaRDI portal
The following pages link to Minmax regret location--allocation problem on a network under uncertainty (Q864020):
Displaying 16 items.
- Minmax regret 1-facility location on uncertain path networks (Q297369) (← links)
- Location-aided routing with uncertainty in mobile ad hoc networks: a stochastic semidefinite programming approach (Q646169) (← links)
- On minimax-regret Huff location models (Q709114) (← links)
- Robust location of new housing developments using a choice model (Q1730557) (← 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)
- A distributionally robust optimization approach for two-stage facility location problems (Q2195563) (← links)
- Minimax regret 1-sink location problem in dynamic path networks (Q2348257) (← links)
- \(\gamma\)-robust facility relocation problem (Q2355805) (← links)
- Minmax regret maximal covering location problems with edge demands (Q2668649) (← links)
- Minimax regret path location on trees (Q3100694) (← links)
- Optimal Location-Relocation Decisions on Stochastic Networks (Q3755208) (← 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)
- Dynamic location problem under uncertainty with a regret‐based measure of robustness (Q5374527) (← links)
- Mathematical optimization models for reallocating and sharing health equipment in pandemic situations (Q6113556) (← links)
