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

DOI10.1016/S0166-218X(02)00384-0zbMATH Open1038.90041MaRDI QIDQ1811071FDOQ1811071

Authors: Igor Averbakh 

Publication date: 10 June 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

NP-completenessLocationMinmax regret optimization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Minimax problems in mathematical programming (90C47) Discrete location and assignment (90B80)

Cites Work

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

Cited In (24)

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