Branch-and-bound as a higher-order function
- 1 May 1991
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 33 (5), 379-402
- https://doi.org/10.1007/bf02073942
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- An SST‐based algorithm for the steiner problem in graphsNetworks, 1989
- DIB—a distributed implementation of backtrackingACM Transactions on Programming Languages and Systems, 1987
- Problem reduction methods and a tree generation algorithm for the steiner network problemNetworks, 1987
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- A Formal Basis for the Heuristic Determination of Minimum Cost PathsIEEE Transactions on Systems Science and Cybernetics, 1968
- Letter to the Editor—A Note on the Branch-and-Bound PrincipleOperations Research, 1968
- Optimum Seeking with Branch and BoundManagement Science, 1966
- An Additive Algorithm for Solving Linear Programs with Zero-One VariablesOperations Research, 1965
- A tree-search algorithm for mixed integer programming problemsThe Computer Journal, 1965
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957