The Set Packing Problem is a combinatorial optimization problem in which the objective is to select the maximum number of pairwise disjoint subsets from a given collection of subsets over a finite ground set, such that no two selected subsets share a common element.
181
Publications
8.8K
Citations
366
Authors
229
Institutions
Publications per year
2017–2026
22
Parents
Publications
181
1–5 of 181
Authors
366
- XD
4
h-index
- XG
4
h-index
- AC
4
h-index
- YK
3
h-index
- KK
3
h-index
1–5 of 366
Institutions
229
Carnegie Mellon University
Pittsburgh, United States
5 h-index
6 publications
147 citations
Hong Kong University of Science and Technology
Hong Kong, Hong Kong
4 h-index
8 publications
238 citations
National University of Singapore
Singapore, Singapore
4 h-index
5 publications
158 citations
Georgia Institute of Technology
Atlanta, United States
4 h-index
5 publications
202 citations
Tel Aviv University
Tel Aviv, Israel
4 h-index
7 publications
414 citations
Centre National de la Recherche Scientifique
Paris, France
4 h-index
10 publications
310 citations
University of Bologna
Bologna, Italy
4 h-index
5 publications
363 citations
Texas A&M University
College Station, United States
4 h-index
8 publications
581 citations
1–8 of 229
Venues
- European Journal of Operational Research
8 publications · 283 citations
8
h-index
- Computers & Operations Research
7 publications · 434 citations
7
h-index
- SIAM Journal on Discrete Mathematics
6 publications · 370 citations
6
h-index
- Mathematical Programming
6 publications · 718 citations
6
h-index
- Journal of Combinatorial Theory Series A
6 publications · 454 citations
6
h-index
1–5