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 right-hand-side. 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 the customary set of binary solution vectors. Linear programming is used to obtain bounds on the minimal cost of the subproblems that arise. Computational results are reported for several large problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Garfinkel, R.S. and Nemhauser, G.L., “Optimal Set Covering: A Survey”, in A. Geoffrion (ed.), Perspectives on Optimization.
_and_, “The Set Partitioning Problem: Set Covering with Equality Constraints,” Operations Research, 17, 5, 848–856, September-October, 1969.
Geoffrion, A.M. and Marsten, R.E., “Integer Programming Algorithms: A Framework and State-of-the-Art Survey”, Management Science, 18, 9, 465–491, 1972.
Marsten, R.E., An Implicit Enumeration Algorithm for the Set Partitioning Problem with Side Constraints, Ph.D. Dissertation, University of California, Los Angeles, October, 1971.
Pierce, J.F., “Application of Combinatorial Programming to a Class of All-Zero-One Integer Programming Problems,” Management Science, 15, 191–209, 1968.
_ and Lasky, J.A., “Improved Combinatorial Programming Algorithms for a Class of All-Zero-One Integer Programming Problems,” Management Science, 19, 528–543, 1973.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1975 D. Reidel Publishing Company, Dordrecht-Holland
About this paper
Cite this paper
Marsten, R.E. (1975). An Algorithm for Large Set Partitioning Problems. In: Roy, B. (eds) Combinatorial Programming: Methods and Applications. NATO Advanced Study Institutes Series, vol 19. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-7557-9_12
Download citation
DOI: https://doi.org/10.1007/978-94-011-7557-9_12
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-011-7559-3
Online ISBN: 978-94-011-7557-9
eBook Packages: Springer Book Archive