PARTITIONING PROBLEM

Partitioning problem - This is the combination of packing and covering . Its IP form is Opt(cx: Ax=b, x in (0,1)ⁿ), where Opt could be Min or Max, and A is a 0-1 matrix. The equation A(i,.)x=b_i means that exactly b_i elements must be selected from set i. In particular, a multiple choice constraint is Sum_j(x_j)=1.