Set Partitioning Problem
The Set Partitioning Problem is a combinatorial optimization problem in integer programming that seeks to select a subset of given sets such that each element in the universe is covered exactly once and the total cost of the selected sets is minimized.
375
Publications
23.6K
Citations
769
Authors
414
Institutions
Publications per year
2017–2026
46
Parents
375
Cluster analysis and mathematical programming
Pierre Hansen, Brigitte Jaumard · Mathematical Programming · 1997 · 617 citations
1–5 of 375
769
7
h-index
7
h-index
7
h-index
6
h-index
6
h-index
1–5 of 769
414

University of Bologna
Bologna, Italy
13 h-index
22 publications
3.4K citations

Polytechnique Montréal
Montreal, Canada
13 h-index
28 publications
4.2K citations
Group for Research in Decision Analysis
Montreal, Canada
10 h-index
24 publications
5.6K citations
University of California, Berkeley
Berkeley, United States
8 h-index
10 publications
424 citations
University of California, Los Angeles
Los Angeles, United States
8 h-index
11 publications
481 citations
HEC Montréal
Montreal, Canada
8 h-index
9 publications
3.1K citations

Centre National de la Recherche Scientifique
Paris, France
7 h-index
12 publications
350 citations
National University of Singapore
Singapore, Singapore
7 h-index
10 publications
245 citations
1–8 of 414
25 publications · 3.8K citations
20
h-index
14 publications · 681 citations
13
h-index
10 publications · 1.5K citations
10
h-index
9 publications · 644 citations
9
h-index
8 publications · 575 citations
8
h-index
1–5