Dominating Set Location Problem

The Dominating Set Location Problem is a combinatorial optimization model in facility location theory that identifies a minimal set of facility sites such that every demand point is either directly served by a facility or located within a specified coverage threshold of at least one facility, ensuring dominance over the entire network.

29

Publications

1.8K

Citations

70

Authors

50

Institutions

Publications per year

2017–2026

6

Authors

70

  1. PJ
    Peter J. Slater

    University of Alabama in Huntsville, United States

    4 publications · 349 citations

    4

    h-index

  2. MA
    Michael A. Henning

    University of Johannesburg, South Africa

    3 publications · 91 citations

    3

    h-index

  3. FF
    Florent Foucaud

    Centre National de la Recherche Scientifique, France

    3 publications · 107 citations

    3

    h-index

  4. GR
    Gabriela R. Argiroffo

    National University of Rosario, Argentina

    2 publications · 29 citations

    2

    h-index

  5. IH
    Iiro Honkala

    University of Turku, Finland

    2 publications · 61 citations

    2

    h-index

1–5 of 70

Venues

  1. Discrete Applied Mathematics

    5 publications · 147 citations

    5

    h-index

  2. Networks

    3 publications · 304 citations

    3

    h-index

  3. Transportation Science

    2 publications · 91 citations

    2

    h-index

  4. SIAM Journal on Applied Mathematics

    1 publications · 559 citations

    1

    h-index

  5. ACM Transactions on Modeling and Computer Simulation

    TOMACS · 1 publications · 30 citations

    1

    h-index

1–5