The set packing and set covering models are two useful models in integer programming. Sometimes, due to the special structure of the constraint matrix, the natural linear programming relaxation yields an optimal solution which is integral, thus solving the problem. Perfect, ideal and balanced matrices are three classes of constraint matrices with such integrality properties (for the set packing...