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

Authors

63

  1. AT
    Arie Tamir

    Tel Aviv University, Israel

    4 publications · 193 citations

    4

    h-index

  2. BB
    Binay Bhattacharya

    Simon Fraser University, Canada

    3 publications · 84 citations

    3

    h-index

  3. TJ
    Timothy J. Lowe

    University of Iowa, United States

    3 publications · 278 citations

    3

    h-index

  4. BÇ
    Barbaros Ç. Tansel

    Bilkent University, Türkiye

    2 publications · 204 citations

    2

    h-index

  5. SL
    S. L. Hakimi

    Northwestern University, United States

    2 publications · 624 citations

    2

    h-index

1–5 of 63

Venues

  1. Transportation Science

    5 publications · 291 citations

    5

    h-index

  2. European Journal of Operational Research

    4 publications · 138 citations

    4

    h-index

  3. Networks

    3 publications · 72 citations

    3

    h-index

  4. Journal of Algorithms

    2 publications · 163 citations

    2

    h-index

  5. Discrete Applied Mathematics

    2 publications · 25 citations

    2

    h-index

1–5