A Plant Location Guide for the Unsure: Approximation Algorithms for Min-Max Location Problems
From MaRDI portal
Publication:3169083
DOI10.1287/moor.1090.0428zbMath1219.90131OpenAlexW1996509676MaRDI QIDQ3169083
Viswanath Nagarajan, Barbara M. Anthony, Anupam Gupta, Vineet Goyal
Publication date: 27 April 2011
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.1090.0428
Minimax problems in mathematical programming (90C47) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Approximation algorithms (68W25)
Related Items (4)
Approximation algorithms for stochastic combinatorial optimization problems ⋮ On generalizations of network design problems with degree bounds ⋮ Universal Algorithms for Clustering Problems ⋮ On the power of static assignment policies for robust facility location problems
This page was built for publication: A Plant Location Guide for the Unsure: Approximation Algorithms for Min-Max Location Problems
