Abstract
The article proposes a modification of the Gomory cyclic algorithm for the integer linear programming problem. The proposed algorithm is numerically compared with the loop algorithm, the all-integer Gomory algorithm, and Martin's algorithm with improved choice of the generating row. Comparisons are carried out by running time and by the number of added cutting planes.
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.
