Location Science 2015
DOI: 10.1007/978-3-319-13111-5_4
|View full text |Cite
|
Sign up to set email alerts
|

p-Center Problems

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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
15
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 32 publications
(15 citation statements)
references
References 45 publications
(63 reference statements)
0
15
0
Order By: Relevance
“…Another family of problems related to location analysis is the p-center problem (PCP). It comes in several variations, but the general idea is to minimize the maximum distance between a demand point and a closest point belonging to a set of p supply points [4].…”
Section: Location Analysis and Districting Problemsmentioning
confidence: 99%
“…Another family of problems related to location analysis is the p-center problem (PCP). It comes in several variations, but the general idea is to minimize the maximum distance between a demand point and a closest point belonging to a set of p supply points [4].…”
Section: Location Analysis and Districting Problemsmentioning
confidence: 99%
“…The task of this problem is to find a k-center of a graph [15]. The problem and many variants of it including some approximations are known to be NP-hard [3,12]. It is shown in [18] that choosing the nodes of a k-center for amnesiac flooding does not lead to a minimal termination time.…”
Section: State Of the Artmentioning
confidence: 99%
“…Some of the simplest and most studied problems in Discrete Location are the Simple Plant Location Problem (SPLP) (Cho et al 1983;Cornuéjols et al 1977;Cornuéjols and Thizy 1982;Fernández and Landete 2015;Guignard 1980), where the aim is to minimize the sum of the distances from installed facilities to customers; the p-median problem (pM), where the number of facilities to be installed is known beforehand (García et al 2011;Marín and Pelegrín 2019;ReVelle and Swain 1970); and the p-center problem (pCP), where the objective is to minimize the maximum of these distances (Calik et al 2015;Elloumi et al 2004;Hakimi 1964). The simplicity of these models has given rise to many variants.…”
Section: Introductionmentioning
confidence: 99%