Minmax regret location--allocation problem on a network under uncertainty
From MaRDI portal
Publication:864020
DOI10.1016/j.ejor.2005.11.040zbMath1163.90384MaRDI QIDQ864020
Publication date: 12 February 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.11.040
90B10: Deterministic network models in operations research
Related Items
Robust mean absolute deviation problems on networks with linear vertex weights, Mathematical optimization models for reallocating and sharing health equipment in pandemic situations, Minmax regret 1-facility location on uncertain path networks, Efficient algorithms for the minmax regret path center problem with length constraint on trees, An improved algorithm for the minmax regret path center problem on trees, A distributionally robust optimization approach for two-stage facility location problems, Minimax regret 1-sink location problem in dynamic path networks, \(\gamma\)-robust facility relocation problem, Minimax regret path location on trees
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Geometrical properties of the Fermat-Weber problem
- A new upper bound on the complexity of the all pairs shortest path problem
- Semi-obnoxious location models: A global optimization approach
- Sorting weighted distances with applications to objective function evaluations in single facility location problems.
- Algorithms for the robust 1-center problem on a tree
- Algorithmic results for ordered median problems
- A note on the robust 1-center problem on trees
- An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
- A flexible approach to location problems
- Finite Dominating Sets for Network Location Problems
- Efficient Algorithms for Shortest Paths in Sparse Networks
- Minmax-regret robust 1-median location on a tree
- Minmax Regret Median Location on a Network Under Uncertainty
- An improved algorithm for the minmax regret median problem on a tree
- Solving nonconvex planar location problems by finite dominating sets
- On the complexity of a class of combinatorial optimization problems with uncertainty
- A fractional model for locating semi-desirable facilities on networks