Abstract

This paper demonstrates the use of hidden network structure for the solution of set partitioning problems. By finding a hidden network row submatrix, the set partitioning problem is transformed to a network with side constraints. Flow conditions on the revealed pure network are then used in a procedure for effecting variable reduction for the set partitioning. By finding a hidden network column submatrix the set partitioning problem is transformed to a network with side columns. The resulting formulation is used in finding a feasible solution for the set partitioning problem quickly. Computational experience is included.KeywordsSet PartitioningInteger ProgrammingNetworksSubmatrixTransformation

Full Text

Published Version

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 call

Disclaimer: 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.