Technical Note—An Improved Branch-and-Bound Method for Integer Programming

J. A. Tomlin
Additional contact information
J. A. Tomlin: Scientific Control Systems Ltd., London, England

Operations Research, 1971, vol. 19, issue 4, 1070-1075

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.

Date: 1971
References: Add references at CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.19.4.1070 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:19:y:1971:i:4:p:1070-1075

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().