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

Igor Averbakh

Publication date: 10 June 2003

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




Related Items (20)

Efficient algorithms for the minmax regret path center problem with length constraint on treesRobust vertex \(p\)-center model for locating urgent relief distribution centersRobust mean absolute deviation problems on networks with linear vertex weightsAn improved algorithm for the minmax regret path centdian problem on treesMinimax regret spanning arborescences under uncertain costsNew approaches to the robust 1-center location problems on tree networksAn improved algorithm for the minmax regret path center problem on treesA robust \(p\)-center problem under pressure to locate shelters in wildfire contextThe \(p\)-center problem under locational uncertainty of demand pointsFix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertaintyOn a constant factor approximation for minmax regret problems using a symmetry point scenarioAmbulance Emergency Response Optimization in Developing CountriesMinmax regret 1-center algorithms for path/tree/unicycle/cactus networksLexicographicα-robustness: an application to the 1-median problemFacility location problems with uncertainty on the planeA 2-approximation for minmax regret problems via a mid-point scenario optimal solutionMin-max and min-max regret versions of combinatorial optimization problems: A surveyOn the minmax regret path median problem on treesComplexity of the min-max and min-max regret assignment problemsRobust weighted vertex \(p\)-center model considering uncertain data: an application to emergency management



Cites Work


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