Set Covering Problem

The Set Covering Problem is a combinatorial optimization problem in integer programming that seeks to find the minimum-cost subcollection of sets from a given collection such that their union covers all elements of a universal set.

1K

Publications

68.3K

Citations

1.9K

Authors

824

Institutions

Publications per year

2017–2026

103

Variants

Set Covering

Authors

1.9K

  1. BC
    Broderick Crawford

    Pontificia Universidad Católica de Valparaíso, Chile

    13 publications · 406 citations

    13

    h-index

  2. RS
    Ricardo Soto

    Pontificia Universidad Católica de Valparaíso, Chile

    13 publications · 406 citations

    13

    h-index

  3. FP
    Fernando Paredes

    Universidad Diego Portales, Chile

    10 publications · 329 citations

    10

    h-index

  4. FJ
    Francis J. Vasko

    Kutztown University, United States

    9 publications · 307 citations

    9

    h-index

  5. WZ
    William Zhu

    Minnan Normal University, China

    9 publications · 1.7K citations

    9

    h-index

1–5 of 1.9K

Venues

  1. European Journal of Operational Research

    42 publications · 3.1K citations

    25

    h-index

  2. Operations Research

    21 publications · 4.2K citations

    20

    h-index

  3. Theoretical Computer Science

    32 publications · 1.4K citations

    19

    h-index

  4. Information Processing Letters

    23 publications · 1K citations

    18

    h-index

  5. Discrete Applied Mathematics

    25 publications · 1K citations

    18

    h-index

1–5