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

Authors

769

  1. AM
    Aristide Mingozzi

    University of Bologna, Italy

    7 publications · 1.3K citations

    7

    h-index

  2. EM
    Elena M. Kiseleva

    Oles Honchar Dnipro National University, Ukraine

    7 publications · 123 citations

    7

    h-index

  3. FS
    François Soumis

    Polytechnique Montréal, Canada

    7 publications · 848 citations

    7

    h-index

  4. RB
    Roberto Baldacci

    University of Bologna, Italy

    6 publications · 1.2K citations

    6

    h-index

  5. JD
    Jacques Desrosiers

    HEC Montréal, Canada

    6 publications · 2.1K citations

    6

    h-index

1–5 of 769

Venues

  1. Operations Research

    25 publications · 3.8K citations

    20

    h-index

  2. European Journal of Operational Research

    14 publications · 681 citations

    13

    h-index

  3. Management Science

    10 publications · 1.5K citations

    10

    h-index

  4. Computers & Operations Research

    9 publications · 644 citations

    9

    h-index

  5. INFORMS journal on computing

    8 publications · 575 citations

    8

    h-index

1–5