Branch-and-Bound Methods: General Formulation and Properties

L. G. Mitten
Additional contact information
L. G. Mitten: University of British Columbia, Vancouver, Canada

Operations Research, 1970, vol. 18, issue 1, 24-34

Abstract: The branch-and-bound procedure is formulated in rather general terms and necessary conditions for the branching and bounding functions are precisely specified. Results include the standard properties for finite procedures, plus several convergence conditions for infinite procedures. Discrete programming which includes integer programming and combinatorial optimization problems, is discussed and Fibonacci search is presented as an example of a nonfinite branch-and-bound procedure employing an optimal convergence rule.

Date: 1970
References: Add references at CitEc
Citations: View citations in EconPapers (16)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.18.1.24 (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:18:y:1970:i:1:p:24-34

Access Statistics for this article

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