2017
DOI: 10.1016/j.ejor.2017.03.043
|View full text |Cite
|
Sign up to set email alerts
|

The probabilistic p -center problem: Planning service for potential customers

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 14 publications
(2 citation statements)
references
References 24 publications
0
2
0
Order By: Relevance
“…Recall from Martínez-Merino et al (2017) that the Probabilistic pCP (PpCP) is defined as the variant of the pCP where sites represent potential demand points, and the locations of the p centers have to be decided before the actual subset of sites that need to be served is revealed. In this problem, the goal is to minimize the expected maximum distance between a site with demand and its closest center.…”
Section: Saa For the Probabilistic P-center Problemmentioning
confidence: 99%
“…Recall from Martínez-Merino et al (2017) that the Probabilistic pCP (PpCP) is defined as the variant of the pCP where sites represent potential demand points, and the locations of the p centers have to be decided before the actual subset of sites that need to be served is revealed. In this problem, the goal is to minimize the expected maximum distance between a site with demand and its closest center.…”
Section: Saa For the Probabilistic P-center Problemmentioning
confidence: 99%
“…Among other similar facility location problems are Probabilistic p-Center (Martínez-Merino et al, 2017), α-All-Neighbour p-Center (Khuller et al, 2000), Capacitated p-Center (Kramer et al, 2020), and p-Median (Mladenović et al, 2007) problems.…”
Section: Introductionmentioning
confidence: 99%