Complexity of robust single facility location problems on networks with uncertain edge lengths.

Recommendations

Algorithms for the robust 1-center problem on a tree
New approaches to the robust 1-center location problems on tree networks
Interval data minmax regret network optimization problems
Minmax-regret robust 1-median location on a tree
Minmax Regret Median Location on a Network Under Uncertainty

Cites work

scientific article; zbMATH DE number 44281 (Why is no real title available?)
scientific article; zbMATH DE number 3639144 (Why is no real title available?)
scientific article; zbMATH DE number 956792 (Why is no real title available?)
Algorithms for the robust 1-center problem on a tree
Letter to the Editor—Optimum Locations on Graphs with Correlated Normal Demands
Minmax Regret Median Location on a Network Under Uncertainty
Minmax regret solutions for minimax optimization problems with uncertainty
Minmax-regret robust 1-median location on a tree
Optimum Locations on a Graph with Probabilistic Demands
Robust Optimization of Large-Scale Systems
Robust discrete optimization and its applications
Sensitivity Analysis in Minisum Facility Location Problems
\((p-1)/(p+1)\)-approximate algorithms for \(p\)-traveling salesmen problems on a tree with minmax objective

Cited in

(24)

Approximating the probabilistic \(p\)-center problem under pressure
Robust weighted vertex \(p\)-center model considering uncertain data: an application to emergency management
Min-max and min-max regret versions of combinatorial optimization problems: A survey
Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks
Robust mean absolute deviation problems on networks with linear vertex weights
Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty
Efficient algorithms for the minmax regret path center problem with length constraint on trees
Complexity of the min-max and min-max regret assignment problems
A robust \(p\)-center problem under pressure to locate shelters in wildfire context
Robust vertex centdian facility location problem on tree networks
Optimization Problems in Graphs with Locational Uncertainty
Ambulance emergency response optimization in developing countries
The \(p\)-center problem under locational uncertainty of demand points
New approaches to the robust 1-center location problems on tree networks
On a constant factor approximation for minmax regret problems using a symmetry point scenario
An improved algorithm for the minmax regret path centdian problem on trees
Lexicographic \(\alpha\)-robustness: an application to the 1-median problem
Minimax regret spanning arborescences under uncertain costs
Facility location problems with uncertainty on the plane
A 2-approximation for minmax regret problems via a mid-point scenario optimal solution
An improved algorithm for the minmax regret path center problem on trees
Robust vertex \(p\)-center model for locating urgent relief distribution centers
Improved complexity results for the robust mean absolute deviation problem on networks with linear vertex weights
On the minmax regret path median problem on trees

This page was built for publication: Complexity of robust single facility location problems on networks with uncertain edge lengths.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1811071)