Graph P-center Problem
The Graph P-Center Problem is a combinatorial optimization problem in location theory that consists of selecting p facility locations on a graph to minimize the maximum distance from any demand vertex to its nearest facility, distinguished by its formulation on graph structures with discrete vertex-based demand and service metrics.
55
Publications
3.8K
Citations
98
Authors
81
Institutions
Publications per year
2017–2026
7
Variants
Vertex P-center Problem
Parents
55
A simple heuristic for the p-centre problem
Martin Dyer, Alan Frieze · Operations Research Letters · 1985 · 170 citations
1–5 of 55
98
3
h-index
3
h-index
3
h-index
3
h-index
3
h-index
1–5 of 98
81

Tel Aviv University
Tel Aviv, Israel
5 h-index
7 publications
172 citations

Shanghai University
Shanghai, China
3 h-index
6 publications
76 citations
Northwestern University
Evanston, United States
3 h-index
4 publications
1.2K citations

National Yang Ming Chiao Tung University
Hsinchu, Taiwan
3 h-index
3 publications
163 citations

Bilkent University
Ankara, Türkiye
3 h-index
4 publications
422 citations

Indian Institute of Technology Bombay
Mumbai, India
2 h-index
2 publications
93 citations

University of Birmingham
Birmingham, United Kingdom
2 h-index
3 publications
82 citations

National Taiwan University
Taipei, Taiwan
2 h-index
2 publications
91 citations
1–8 of 81
7 publications · 346 citations
7
h-index
5 publications · 232 citations
5
h-index
OR · 4 publications · 207 citations
4
h-index
4 publications · 134 citations
4
h-index
3 publications · 82 citations
3
h-index
1–5