P-median Problem
The p-Median Problem is a discrete facility location problem that belongs to the class of combinatorial optimization problems, distinguished by its objective to locate exactly p facilities such that the sum of the weighted distances from each demand point to its nearest facility is minimized.
491
Publications
32K
Citations
848
Authors
481
Institutions
Publications per year
2017–2026
87
Parents
491
1–5 of 491
848
University of California, Santa Barbara, United States
15 publications · 677 citations
14
h-index
13
h-index
12
h-index
10
h-index
10
h-index
1–5 of 848
481
University of California, Santa Barbara
Santa Barbara, United States
12 h-index
18 publications
601 citations
Erasmus University Rotterdam
Rotterdam, The Netherlands
12 h-index
15 publications
840 citations

University of Žilina
Žilina, Slovakia
12 h-index
27 publications
602 citations
HEC Montréal
Montreal, Canada
11 h-index
16 publications
2.8K citations

Johns Hopkins University
Baltimore, United States
10 h-index
11 publications
986 citations

University of Alberta
Edmonton, Canada
9 h-index
13 publications
705 citations
Group for Research in Decision Analysis
Montreal, Canada
9 h-index
12 publications
2.5K citations
The Ohio State University
Columbus, United States
9 h-index
12 publications
954 citations
1–8 of 481
46 publications · 4.8K citations
32
h-index
33 publications · 1.7K citations
24
h-index
14 publications · 815 citations
13
h-index
16 publications · 803 citations
13
h-index
12 publications · 329 citations
11
h-index
1–5