Reference work entry
The set-partitioning problem is an integer-programming problem defined as follows:where the components of Ev are either 1 or 0, the components of the column vector ev are all 1s, and the variables are restricted to be either 1 or 0. It is similar to a set-covering problem except multiple coverage is allowed. Packing problem; Set-covering problem.
subject to Exv = ev
© Kluwer Academic Publishers 2001