Optimum Seeking with Branch and Bound

Norman Agin
Additional contact information
Norman Agin: Mathematica

Management Science, 1966, vol. 13, issue 4, B176-B185

Abstract: A wide variety of branch and bound algorithms have recently been described in the literature. This paper provides a generalized description of such algorithms. An objective is to demonstrate the wide applicability of branch and bound to combinatorial problems in general. Two existing algorithms are used as illustrations and a discussion of computational efficiency is included.

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

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.13.4.B176 (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:ormnsc:v:13:y:1966:i:4:p:b176-b185

Access Statistics for this article

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