p-Center Problems

Hatice Calik (), Martine Labbé () and Hande Yaman ()
Additional contact information
Hatice Calik: Bilkent University
Martine Labbé: Université Libre de Bruxelles
Hande Yaman: Bilkent University

Chapter Chapter 4 in Location Science, 2015, pp 79-92 from Springer

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

Keywords: p-Center; Location in public sector; Minimax facility location (search for similar items in EconPapers)
Date: 2015
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-319-13111-5_4

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

DOI: 10.1007/978-3-319-13111-5_4

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 ().