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
1K
A threshold of ln <i>n</i> for approximating set cover
Uriel Feige · Journal of the ACM · 1998 · 3.1K citations · Full text
A Greedy Heuristic for the Set-Covering Problem
Vašek Chvátal · Mathematics of Operations Research · 1979 · 2.6K citations
The Location of Emergency Service Facilities
Constantine Toregas, Ralph W. Swain, Charles ReVelle et al. · Operations Research · 1971 · 1.8K citations
1–5 of 1K
1.9K
Pontificia Universidad Católica de Valparaíso, Chile
13 publications · 406 citations
13
h-index
13
h-index
10
h-index
9
h-index
9
h-index
1–5 of 1.9K
824
Carnegie Mellon University
Pittsburgh, United States
21 h-index
47 publications
2.1K citations

University of Bologna
Bologna, Italy
17 h-index
26 publications
2.6K citations

Centre National de la Recherche Scientifique
Paris, France
16 h-index
37 publications
1.7K citations
Georgia Institute of Technology
Atlanta, United States
14 h-index
25 publications
1K citations
Pontificia Universidad Católica de Valparaíso
Valparaíso, Chile
13 h-index
57 publications
1.7K citations
University of California, Berkeley
Berkeley, United States
13 h-index
18 publications
2.1K citations
Massachusetts Institute of Technology
Cambridge, United States
13 h-index
26 publications
1.1K citations
Technion – Israel Institute of Technology
Haifa, Israel
13 h-index
26 publications
1.1K citations
1–8 of 824
42 publications · 3.1K citations
25
h-index
21 publications · 4.2K citations
20
h-index
32 publications · 1.4K citations
19
h-index
23 publications · 1K citations
18
h-index
25 publications · 1K citations
18
h-index
1–5