Sensitivity analysis in minisum facility location problems
Operations Research
Minmax Regret Median Location on a Network Under Uncertainty
INFORMS Journal on Computing
Minmax regret solutions for minimax optimization problems with uncertainty
Operations Research Letters
The Minmax Relative Regret Median Problem on Networks
INFORMS Journal on Computing
Improved algorithms for the minmax-regret 1-center and 1-median problems
ACM Transactions on Algorithms (TALG)
Minimax Regret Single-Facility Ordered Median Location Problems on Networks
INFORMS Journal on Computing
Survey: Facility location dynamics: An overview of classifications and applications
Computers and Industrial Engineering
A 2-approximation for minmax regret problems via a mid-point scenario optimal solution
Operations Research Letters
Facility location problems with uncertainty on the plane
Discrete Optimization
Complexity of the min-max and min-max regret assignment problems
Operations Research Letters
Robust vertex p-center model for locating urgent relief distribution centers
Computers and Operations Research
| Hi-index | 0.04 |
We consider single-facility location problems on a network with uncertain edge lengths. Specifically, the lengths of edges are assumed to be random with unknown distributions and can take on any values within prespecified intervals of uncertainty. Uncertainty in edge lengths reflects uncertainty in transportation times, or transportation costs, along the edges. It is required to find a robust (minmax regret) solution, that is, a location which is ε-optimal for any possible realization of edge lengths, with ε as small as possible. We show that such robust location problems are strongly NP-hard, in contrast with robust location problems with only node weights uncertainty that are known to be polynomially solvable.