A p-center is a minimax solution that consists of a set of p points minimizing the maximum distance between a demand point and a closest point belonging to that set. We present different variants of this problem. We review special polynomial cases, determine the complexity of the problems and present mixed integer linear programming formulations, exact algorithms and heuristics. Several extensions are also reviewed.
Keywordsp-Center Minimax facility location Location in public sector
The research of the second author is supported by the Interuniversity Attraction Poles Programme initiated by the Belgian Science Policy Office and the research of the third author is supported by the Turkish Academy of Sciences.
- Averbakh I (1997) On the complexity of a class of robust location problems. Working Paper, Western Washington University, BellinghamGoogle Scholar
- Çalık H (2013) Exact solution methodologies for the p-center problem under single and multiple allocation strategies. Ph.D. Thesis, Bilkent University, AnkaraGoogle Scholar
- Fernandes CG, de Paula SP, Pedrosa LL (2018) Improved approximation algorithms for capacitated fault-tolerant k-center Algorithmica 80:1041–1072Google Scholar
- Ilhan T, Pınar MÇ (2001) An efficient exact algorithm for the vertex p-center problem. Bilkent University, Department of Industrial Engineering, Technical Report. http://www.ie.bilkent.edu.tr/~mustafap/pubs