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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
