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

Authors

98

  1. BÇ
    Barbaros Ç. Tansel

    Bilkent University, Türkiye

    3 publications · 315 citations

    3

    h-index

  2. AT
    Arie Tamir

    Tel Aviv University, Israel

    3 publications · 77 citations

    3

    h-index

  3. SL
    S. L. Hakimi

    Northwestern University, United States

    3 publications · 1.8K citations

    3

    h-index

  4. LK
    Liying Kang

    Shanghai University, China

    3 publications · 42 citations

    3

    h-index

  5. ZD
    Zvi Drezner

    California State University, Fullerton, United States

    3 publications · 180 citations

    3

    h-index

1–5 of 98

Venues

  1. European Journal of Operational Research

    7 publications · 346 citations

    7

    h-index

  2. Computers & Operations Research

    5 publications · 232 citations

    5

    h-index

  3. Journal of the Operational Research Society

    OR · 4 publications · 207 citations

    4

    h-index

  4. Discrete Applied Mathematics

    4 publications · 134 citations

    4

    h-index

  5. Theoretical Computer Science

    3 publications · 82 citations

    3

    h-index

1–5