An Algorithm for Large Set Partitioning Problems

Roy E. Marsten
Additional contact information
Roy E. Marsten: Northwestern University

Management Science, 1974, vol. 20, issue 5, 774-787

Abstract: An algorithm is presented for the special integer linear program known as the set partitioning problem. This problem has a binary coefficient matrix, binary variables, and unit resources. Furthermore, all of its constraints are equations. In spite of its very special form, the set partitioning problem has many practical interpretations. The algorithm is of the branch and bound type. A special class of finite mappings is enumerated rather than the customary set of binary solution vectors. Linear programming is used to obtain bounds on the minimal costs of the subproblems that arise. Computational results are reported for several large problems.

Date: 1974
References: Add references at CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.20.5.774 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:20:y:1974:i:5:p:774-787

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().