Optimum Seeking with Branch and Bound
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.
Year of publication: |
1966
|
---|---|
Authors: | Agin, Norman |
Published in: |
Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 13.1966, 4, p. 176-176
|
Publisher: |
Institute for Operations Research and the Management Sciences - INFORMS |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Agin, Norman, (1966)
-
Optimum seeking with branch and bound
Agin, Norman, (1966)
-
End-User Rights For Access To Mainframe Data
Agin, Norman, (1994)
- More ...