Minimum Set Problem

The Minimum Set Problem is a combinatorial optimization problem in reserve design that seeks to identify the smallest subset of spatial units required to represent all conservation targets, distinguishing it from other reserve selection models by prioritizing minimal area coverage while ensuring complete representation of species or features.

105

Publications

5.1K

Citations

307

Authors

177

Institutions

Publications per year

2017–2026

25

Authors

307

  1. CS
    Costas S. Iliopoulos

    King's College London, United Kingdom

    2 publications · 28 citations

    2

    h-index

  2. LA
    Len Adleman

    University of Southern California, United States

    2 publications · 162 citations

    2

    h-index

  3. YL
    Yang Li

    Beihang University, China

    2 publications · 92 citations

    2

    h-index

  4. PW
    Paul Wilhelm Karl Rothemund

    Cornell University, United States

    2 publications · 162 citations

    2

    h-index

  5. SK
    Sanjeev Khanna

    University of Pennsylvania, United States

    2 publications · 52 citations

    2

    h-index

1–5 of 307

Venues

  1. Murdoch Research Repository (Murdoch University)

    Repository · 2 publications · 28 citations

    2

    h-index

  2. Theoretical Computer Science

    2 publications · 30 citations

    2

    h-index

  3. IEEE Transactions on Power Systems

    2 publications · 96 citations

    2

    h-index

  4. Proceedings of the IEEE

    2 publications · 625 citations

    2

    h-index

  5. Psychometrika

    2 publications · 40 citations

    2

    h-index

1–5