Branch-and-Bound Methods: A Survey
Operations Research
1966
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.
- DOI
- 10.1287/opre.14.4.699
- Volume
- 14 (4)
- Pages
- 699-719
- Language
- en
- Export
- BibTeX
- Sources
- crossref