Weighted P-center Problem

The Weighted P-Center Problem is a variant of the p-center problem in facility location theory where each demand point is assigned a weight representing its relative importance, and the objective is to locate p facilities such that the maximum weighted distance from any demand point to its nearest facility is minimized.

14

Publications

690

Citations

26

Authors

20

Institutions

Publications per year

2017–2026

2

Authors

26

  1. FN
    François Nicolas

    Centre National de la Recherche Scientifique, France

    1 publications · 47 citations

    1

    h-index

  2. AP
    Anu Pathria

    University of California, Berkeley, United States

    1 publications · 15 citations

    1

    h-index

  3. GK
    Golbarg Kazemi Tutunchi

    North Carolina State University, United States

    1 publications · 20 citations

    1

    h-index

  4. PM
    Pravin M. Vaidya

    University of Illinois Urbana-Champaign, United States

    1 publications · 28 citations

    1

    h-index

  5. SZ
    Shuzhong Zhang

    Chinese University of Hong Kong, Hong Kong SAR China

    1 publications · 14 citations

    1

    h-index

1–5 of 26

Venues

  1. European Journal of Operational Research

    3 publications · 104 citations

    3

    h-index

  2. Transportation Science

    2 publications · 88 citations

    2

    h-index

  3. SIAM Journal on Computing

    1 publications · 127 citations

    1

    h-index

  4. Networks

    1 publications · 31 citations

    1

    h-index

  5. DSpace@MIT (Massachusetts Institute of Technology)

    Repository · 1 publications · 16 citations

    1

    h-index

1–5