Network P-center Problem
The Network P-Center Problem is a combinatorial optimization problem in location theory that, given a network with weighted edges and a set of demand nodes, seeks to locate *p* facilities at nodes or along edges such that the maximum distance from any demand node to its nearest facility is minimized.
34
Publications
2.2K
Citations
63
Authors
53
Institutions
Publications per year
2017–2026
2
Parents
34
1–5 of 34
63
4
h-index
3
h-index
3
h-index
2
h-index
2
h-index
1–5 of 63
53

Tel Aviv University
Tel Aviv, Israel
4 h-index
5 publications
167 citations
Simon Fraser University
Burnaby, Canada
3 h-index
5 publications
145 citations

Pennsylvania State University
State College, United States
2 h-index
3 publications
314 citations

California State University, Fullerton
Fullerton, United States
2 h-index
2 publications
101 citations

University of Toronto
Toronto, Canada
2 h-index
2 publications
136 citations
Bursa Uludağ Üni̇versi̇tesi̇
Bursa, Türkiye
1 h-index
2 publications
24 citations

University of Baltimore
Baltimore, United States
1 h-index
2 publications
322 citations
Citadel
Charleston, United States
1 h-index
1 publications
74 citations
1–8 of 53
5 publications · 291 citations
5
h-index
4 publications · 138 citations
4
h-index
3 publications · 72 citations
3
h-index
2 publications · 163 citations
2
h-index
2 publications · 25 citations
2
h-index
1–5