Skip to main content
SpringerLink
Log in

p-Center Problems

  • Chapter
  • First Online:
Location Science

Abstract

A p-center is a minimax solution that consists in a set of p points that minimizes the maximum distance between a demand point and a closest point belonging to that set. We present different variants of that 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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 89.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  • Albareda-Sambola M, Díaz JA, Fernández E (2010) Lagrangean duals and exact solution to the capacitated p-center problem. Eur J Oper Res 201:71–81

    Article  Google Scholar 

  • Averbakh I (1997) On the complexity of a class of robust location problems. Working paper. Western Washington University, Bellingham

    Google Scholar 

  • Averbakh I, Berman O (1997) Minimax regret p-center location on a network with demand uncertainty. Locat Sci 5:247–254

    Article  Google Scholar 

  • Averbakh I, Berman O (2000) Algorithms for the robust 1-center problem on a tree. Eur J Oper Res 123:292–302

    Article  Google Scholar 

  • Bar-Ilan J, Kortsarz G, Peleg D (1993) How to allocate network centers. J Algorithm 15:385–415

    Article  Google Scholar 

  • Beasley JE (1990) OR-Library: distributing test problems by electronic mail. J Oper Res Soc 41:1069–1072

    Article  Google Scholar 

  • Berge B (1967) Théorie des graphes et ses applications. Dunod, Paris

    Google Scholar 

  • Berman O, Drezner Z (2008) A new formulation for the conditional p-median and p-center problems. Oper Res Lett 36:481–483

    Article  Google Scholar 

  • Berman O, Simchi-Levi D (1990) Conditional location problems on networks. Transp Sci 24:77–78

    Article  Google Scholar 

  • Bozkaya B, Tansel B (1998) A spanning tree approach to the absolute p-center problem. Locat Sci 6:83–107

    Article  Google Scholar 

  • Calik H (2013) Exact solution methodologies for the p-center problem under single and multiple allocation strategies. Ph.D. thesis, Bilkent University, Ankara

    Google Scholar 

  • Calik H, Tansel BC (2013) Double bound method for solving the p-center location problem. Comput Oper Res 40:2991–2999

    Article  Google Scholar 

  • Chechik S, Peleg D (2012) The fault tolerant capacitated k-center problem. In: Structural information and communication complexity. Springer, Berlin/Heidelberg

    Google Scholar 

  • Chen D, Chen R (2013) Optimal algorithms for the α-neighbor p-center problem. Eur J Oper Res 225:36–43

    Article  Google Scholar 

  • Daskin MS (2013) Network and discrete location: models, algorithms, and applications, 2nd edn. Wiley, Hoboken

    Book  Google Scholar 

  • Drezner Z (1989) Conditional p-center problems. Transp Sci 23:51–53

    Article  Google Scholar 

  • Dyer ME, Frieze AM (1985) A simple heuristic for the p-center problem. Oper Res Lett 3:285–288

    Article  Google Scholar 

  • Elloumi S, Labbé M, Pochet Y (2004) A new formulation and resolution method for the p-center problem. INFORMS J Comput 16:84–94

    Article  Google Scholar 

  • Garfinkel R, Neebe A, Rao M (1977) The m-center problem: minimax facility location. Manag Sci 23:1133–1142

    Article  Google Scholar 

  • Goldman AJ (1972) Minimax location of a facility in a network. Transp Sci 6:407–418

    Article  Google Scholar 

  • Hakimi SL (1964) Optimum locations of switching centers and the absolute centers and medians of a graph. Oper Res 12:450–459

    Article  Google Scholar 

  • Hakimi SL (1965) Optimum distribution of switching centers in a communication network and some related graph theoretic problems. Oper Res 13:462–475

    Article  Google Scholar 

  • Handler GY (1973) Minimax location of a facility in an undirected tree network. Transp Sci 7:287–293

    Article  Google Scholar 

  • Hansen P, Labbé M, Nicloas B (1991) The continuous center set of a network. Discrete Appl Math 30:181–195

    Article  Google Scholar 

  • Hochbaum DS, Shmoys DB (1985) A best possible heuristic for the k-center problem. Math Oper Res 10:180–184

    Article  Google Scholar 

  • Hsu W-L, Nemhauser GL (1979) Easy and hard bottleneck location problems. Discrete Appl Math 1:209–215

    Article  Google Scholar 

  • Ilhan T, Pınar MÇ (2001) An efficient exact algorithm for the vertex p-center problem. Technical report, Department of Industrial Engineering, Bilkent University. http://www.ie.bilkent.edu.tr/~mustafap/pubs

  • Jaeger M, Goldberg J (1994) A polynomial algorithm for the equal capacity p-center problem on trees. Transp Sci 28:167–175

    Article  Google Scholar 

  • Kariv O, Hakimi SL (1979) An algorithmic approach to network location problems. I: the p-centers. SIAM J Appl Math 37:513–538

    Article  Google Scholar 

  • Khuller S, Sussmann YJ (2000) The capacitated k-center problem. SIAM J Discrete Math 13:403–418

    Article  Google Scholar 

  • Khuller S, Pless R, Sussmann YJ (2000) Fault tolerant K-center problems. Theor Comput Sci 242:237–245

    Article  Google Scholar 

  • Krumke OS (1995) On a generalization of the p-center problem. Inform Process Lett 56:67–71

    Article  Google Scholar 

  • Lorena LAN, Senne ELF (2004) A column generation approach to capacitated p-median problems. Comput Oper Res 31:863–876

    Article  Google Scholar 

  • Martinich JS (1988) A vertex-closing approach to the p-center problem. Nav Res Log 35:185–201

    Article  Google Scholar 

  • Megiddo N (1983) Linear-time algorithms for linear programming in R 3 and related problems. SIAM J Comput 12:759–776

    Article  Google Scholar 

  • Mihelič J, Robič B (2005) Solving the k-center problem efficiently with a dominating set algorithm. J Comput Inform Technol 13:225–233

    Article  Google Scholar 

  • Minieka E (1970) The m-center problem. SIAM Rev 12:138–139

    Article  Google Scholar 

  • Minieka E (1980) Conditional centers and medians on a graph. Networks 10:265–272

    Article  Google Scholar 

  • Mladenović N, Labbé M, Hansen P (2003) Solving the p-center problem with tabu search and variable neighborhood search. Networks 42:48–64

    Article  Google Scholar 

  • Ozsoy FA, Pinar MC (2006) An exact algorithm for the capacitated vertex p-center problem. Comput Oper Res 33:1420–1436

    Article  Google Scholar 

  • Pullan W (2008) A memetic genetic algorithm for the vertex p-center problem. Evol Comput 16:417–436

    Article  Google Scholar 

  • Reinelt G (1991) TSPLIB - a traveling salesman problem library. ORSA J Comput 3:376–384

    Article  Google Scholar 

  • Salhi S, Al-Khedhairi A (2010) Integrating heuristic information into exact methods: the case of the vertex p-centre problem. J Oper Res Soc 61:1619–1631

    Article  Google Scholar 

  • Scapparra MP, Pallotino S, Scutella MG (2004) Large-scale local search heuristics for the capacitated vertex p-center problem. Networks 43:241–255

    Article  Google Scholar 

  • Tamir A (1987) On the solution value of the continuous p-center location problem on a graph. Math Oper Res 12:340–349

    Article  Google Scholar 

  • Tamir A (1988) Improved complexity bounds for center location problems on networks fy using dynamic data structures. SIAM J Discrete Math 1:377–396

    Article  Google Scholar 

  • Tansel BÇ (2011) Discrete center problems. In: Eiselt HA, Marianov V (eds) Foundations of location analysis. Springer, New York, pp 79–106

    Chapter  Google Scholar 

Download references

Acknowledgements

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.

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Bilkent University, Bilkent, 06800, Ankara, Turkey

    Hatice Calik & Hande Yaman

  2. HEC Montréal, Canada Research Chair in Logistics and Transportation, Montréal, QC, Canada, H3T 2A7

    Hatice Calik

  3. Department of Computer Science, Université Libre de Bruxelles, CP 212, Boulevard du Triomphe, 1050, Brussels, Belgium

    Martine Labbé

Authors
  1. Hatice Calik
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Martine Labbé
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hande Yaman
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hatice Calik .

Editor information

Editors and Affiliations

  1. HEC Montréal, Montréal, Canada

    Gilbert Laporte

  2. Institute of Operations Research (IOR), Karlsruhe Institute of Technology, Karlsruhe, Germany

    Stefan Nickel

  3. DEIO-FCUL, University of Lisbon, Lisbon, Portugal

    Francisco Saldanha da Gama

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Calik, H., Labbé, M., Yaman, H. (2015). p-Center Problems. In: Laporte, G., Nickel, S., Saldanha da Gama, F. (eds) Location Science. Springer, Cham. https://doi.org/10.1007/978-3-319-13111-5_4

Download citation

Publish with us

Policies and ethics

Search

Navigation