Abstract

Balas and Saltzman identified several classes of facet inducing inequalities for the three-index assignment polytope, and gave O( n 4 ) separation algorithms for two of them. We give O( n 3 ) separation algorithms for these two classes of facets, and also for a third class. Since the three-index assignment problem has n 3 variables, these algorithms are linear-time and their complexity is best possible.

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.