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

Authors

848

  1. RL
    Richard L. Church

    University of California, Santa Barbara, United States

    15 publications · 677 citations

    14

    h-index

  2. NM
    Nenad Mladenović

    Serbian Academy of Sciences and Arts, Serbia

    14 publications · 2K citations

    13

    h-index

  3. KE
    Kenneth E. Rosing

    Erasmus University Rotterdam, Netherlands

    12 publications · 751 citations

    12

    h-index

  4. JB
    Jack Brimberg

    Royal Military College of Canada, Canada

    10 publications · 1.2K citations

    10

    h-index

  5. PH
    Pierre Hansen

    Group for Research in Decision Analysis, Canada

    10 publications · 1.7K citations

    10

    h-index

1–5 of 848

Venues

  1. European Journal of Operational Research

    46 publications · 4.8K citations

    32

    h-index

  2. Computers & Operations Research

    33 publications · 1.7K citations

    24

    h-index

  3. Geographical Analysis

    14 publications · 815 citations

    13

    h-index

  4. Networks

    16 publications · 803 citations

    13

    h-index

  5. 11

    h-index

1–5