Set Partitioning and Chain Decomposition

There is given a finite set I and a family of subsets of I. We consider the problem of determining a minimum cardinality subfamily that is a partition of I. A branch-and-bound algorithm is presented. The bounds are obtained by determining chain decompositions of directed acyclic graphs. The computation time required to determine a bound is bounded by a polynomial in the cardinality of I. Some computational experience is reported and relationships with other methods are discussed.

• 저널Management Science · 20(11) · 1413–1423
• 토픽Optimization and Packing Problems · Industrial and Manufacturing Engineering
• DOI10.1287/mnsc.20.11.1413
• 저자G. L. Nemhauser, L. E. Trotter, Robert M. Nauss