p-Center Problems

Hatice Çalık (), Martine Labbé () and Hande Yaman ()
Additional contact information
Hatice Çalık: KU Leuven, Department of Computer Science, CODeS
Martine Labbé: Université Libre de Bruxelles, Department of Computer Science
Hande Yaman: ORSTAT, KU Leuven, Faculty of Economics and Business

Chapter Chapter 3 in Location Science, 2019, pp 51-65 from Springer

Abstract: Abstract 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.

Keywords: p-Center; Minimax facility location; Location in public sector (search for similar items in EconPapers)
Date: 2019
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-030-32177-2_3

Ordering information: This item can be ordered from
http://www.springer.com/9783030321772

DOI: 10.1007/978-3-030-32177-2_3

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().