Abstract
The problem of constructing optimum cuts in the Gomory method for integer linear programming (ILP) problems is considered. Algorithms for finding cuts are described, and their complexity is assessed. The modified Gomory algorithm is compared to a standard Gomory algorithm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Moscow University Computational Mathematics and Cybernetics
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.