Set Partitioning and Chain Decomposition
Nemhauser, G. L.; Trotter, L. E.; Nauss, R. M.
1974-07-01 00:00:00
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.
http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.pngManagement ScienceINFORMShttp://www.deepdyve.com/lp/informs/set-partitioning-and-chain-decomposition-oz4gxusvLc
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.
To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.