.png){kind=icon}
Return
Technical Note—An Improved Branch-and-Bound Method for Integer Programming
.png){kind=icon}
PRE
AI
DOI：10.1287/opre.19.4.1070.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
No journal information available
Organization
No organization information available
Cited Papers
No cited papers available