Abstract
As pointed out in section 2.4, multi-decision problems are represented naturally by trees in which a node x represents the set of (component) decisions actually made, and the branches from x represent the possible x‘choices of action at x’. The problem of finding an optimal composite decision is equivalent to the problem of finding an optimal path from the root to a terminal node in a search tree (see section 2.4), and one technique for achieving this aim is that of discrete dynamic programming as shown in chapter 2. In this chapter an alternative technique, called branch-and-bound, is introduced and described.
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Copyright information
© 1982 T. B. Boffey
About this chapter
Cite this chapter
Boffey, T.B. (1982). Branch-and-bound Methods. In: Graph Theory in Operations Research. Macmillan Computer Science Series. Palgrave, London. https://doi.org/10.1007/978-1-349-16675-6_3
Download citation
DOI: https://doi.org/10.1007/978-1-349-16675-6_3
Publisher Name: Palgrave, London
Print ISBN: 978-0-333-28214-4
Online ISBN: 978-1-349-16675-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)