Complexity of robust single facility location problems on networks with uncertain edge lengths.
From MaRDI portal
Publication:1811071
DOI10.1016/S0166-218X(02)00384-0zbMath1038.90041MaRDI QIDQ1811071
Publication date: 10 June 2003
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Minimax problems in mathematical programming (90C47) Discrete location and assignment (90B80)
Related Items (20)
Efficient algorithms for the minmax regret path center problem with length constraint on trees ⋮ Robust vertex \(p\)-center model for locating urgent relief distribution centers ⋮ Robust mean absolute deviation problems on networks with linear vertex weights ⋮ An improved algorithm for the minmax regret path centdian problem on trees ⋮ Minimax regret spanning arborescences under uncertain costs ⋮ New approaches to the robust 1-center location problems on tree networks ⋮ An improved algorithm for the minmax regret path center problem on trees ⋮ A robust \(p\)-center problem under pressure to locate shelters in wildfire context ⋮ The \(p\)-center problem under locational uncertainty of demand points ⋮ Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty ⋮ On a constant factor approximation for minmax regret problems using a symmetry point scenario ⋮ Ambulance Emergency Response Optimization in Developing Countries ⋮ Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks ⋮ Lexicographicα-robustness: an application to the 1-median problem ⋮ Facility location problems with uncertainty on the plane ⋮ A 2-approximation for minmax regret problems via a mid-point scenario optimal solution ⋮ Min-max and min-max regret versions of combinatorial optimization problems: A survey ⋮ On the minmax regret path median problem on trees ⋮ Complexity of the min-max and min-max regret assignment problems ⋮ Robust weighted vertex \(p\)-center model considering uncertain data: an application to emergency management
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Robust discrete optimization and its applications
- \((p-1)/(p+1)\)-approximate algorithms for \(p\)-traveling salesmen problems on a tree with minmax objective
- Algorithms for the robust 1-center problem on a tree
- Minmax regret solutions for minimax optimization problems with uncertainty
- Sensitivity Analysis in Minisum Facility Location Problems
- Minmax-regret robust 1-median location on a tree
- Minmax Regret Median Location on a Network Under Uncertainty
- Robust Optimization of Large-Scale Systems
- Optimum Locations on a Graph with Probabilistic Demands
- Letter to the Editor—Optimum Locations on Graphs with Correlated Normal Demands
This page was built for publication: Complexity of robust single facility location problems on networks with uncertain edge lengths.
