Abstract
This note proposes two extensions of the successful Beale and Small branch-and-bound mixed-integer algorithm. The integer requirements on nonbasic variables are utilized to calculate stronger “penalties” when searching down the solution tree and to give a stronger criterion for abandoning unprofitable branches of the tree when backtracking. This stronger criterion is obtained by making use of Gomory cutting-plane constraints. These modifications have produced considerable reductions of the searching effort required for pure integer and predominantly integer problems, and have the further advantage of being very easy to incorporate.
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.
