Theoretical comparisons of search strategies in branch-and-bound algorithms
- 1 December 1976
- journal article
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 5 (4) , 315-344
- https://doi.org/10.1007/bf00998631
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Practical Solution of Large Mixed Integer Programming Problems with UmpireManagement Science, 1974
- Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation ProblemsJournal of the ACM, 1974
- Experiments in mixed-integer linear programmingMathematical Programming, 1971
- 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
- Discrete Programming by the Filter MethodOperations Research, 1967
- Integer Programming by Implicit Enumeration and Balas’ MethodSIAM Review, 1967
- Optimum Seeking with Branch and BoundManagement Science, 1966
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming ProblemOperations Research, 1965
- Backtrack ProgrammingJournal of the ACM, 1965