Minmax regret location--allocation problem on a network under uncertainty
From MaRDI portal
Publication:864020
DOI10.1016/J.EJOR.2005.11.040zbMATH Open1163.90384OpenAlexW2042461890MaRDI QIDQ864020FDOQ864020
Authors: E. Conde 
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
Recommendations
- Minmax Regret Median Location on a Network Under Uncertainty
- Minimax regret p-center location on a network with demand uncertainty
- Minmax regret 1-facility location on uncertain path networks
- Minmax regret 1-facility location on uncertain path networks
- Minimax regret single-facility ordered median location problems on networks
- Minimax regret 1-sink location problems in dynamic path networks
- Minimax regret 1-sink location problem in dynamic path networks
- Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities
- On the approximability of minmax (regret) network optimization problems
- Minimax regret 1-sink location problem with accessibility in dynamic general networks
Cites Work
- Efficient Algorithms for Shortest Paths in Sparse Networks
- Minmax-regret robust 1-median location on a tree
- Title not available (Why is that?)
- On the complexity of a class of combinatorial optimization problems with uncertainty
- Geometrical properties of the Fermat-Weber problem
- Algorithms for the robust 1-center problem on a tree
- Minmax Regret Median Location on a Network Under Uncertainty
- An improved algorithm for the minmax regret median problem on a tree
- Algorithmic results for ordered median problems
- A note on the robust 1-center problem on trees
- A flexible approach to location problems
- Finite Dominating Sets for Network Location Problems
- A new upper bound on the complexity of the all pairs shortest path problem
- An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
- Title not available (Why is that?)
- Semi-obnoxious location models: A global optimization approach
- Sorting weighted distances with applications to objective function evaluations in single facility location problems.
- A fractional model for locating semi-desirable facilities on networks
- Solving nonconvex planar location problems by finite dominating sets
Cited In (15)
- A distributionally robust optimization approach for two-stage facility location problems
- Robust location of new housing developments using a choice model
- 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
- Dynamic location problem under uncertainty with a regret‐based measure of robustness
- On minimax-regret Huff location models
- Optimal Location-Relocation Decisions on Stochastic Networks
- Minmax regret 1-facility location on uncertain path networks
- Minimax regret path location on trees
- \(\gamma\)-robust facility relocation problem
- Minmax regret maximal covering location problems with edge demands
- Robust mean absolute deviation problems on networks with linear vertex weights
- Mathematical optimization models for reallocating and sharing health equipment in pandemic situations
- Location-aided routing with uncertainty in mobile ad hoc networks: a stochastic semidefinite programming approach
- Minimax regret 1-sink location problem in dynamic path networks
Uses Software
This page was built for publication: Minmax regret location--allocation problem on a network under uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q864020)
