Branch-and-Bound Methods: A Survey

E. L. Lawler and D. E. Wood
Additional contact information
E. L. Lawler: The University of Michigan, Ann Arbor, Michigan
D. E. Wood: The University of Michigan, Ann Arbor, Michigan

Operations Research, 1966, vol. 14, issue 4, 699-719

Abstract: The essential features of the branch-and-bound approach to constrained optimization are described, and several specific applications are reviewed. These include integer linear programming (Land-Doig and Balas methods), nonlinear programming (minimization of nonconvex objective functions), the traveling-salesman problem (Eastman and Little, et al. methods), and the quadratic assignment problem (Gilmore and Lawler methods). Computational considerations, including trade-offs between length of computation and storage requirements, are discussed and a comparison with dynamic programming is made. Various applications outside the domain of mathematical programming are also mentioned.

Date: 1966
References: Add references at CitEc
Citations: View citations in EconPapers (62)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.14.4.699 (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:14:y:1966:i:4:p:699-719

Access Statistics for this article

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