Branch-and-bound procedure and state—space representation of combinatorial optimization problems
- 1 January 1978
- journal article
- Published by Elsevier in Information and Control
- Vol. 36 (1) , 1-27
- https://doi.org/10.1016/s0019-9958(78)90197-3
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- The Power of Dominance Relations in Branch-and-Bound AlgorithmsJournal of the ACM, 1977
- Theoretical comparisons of search strategies in branch-and-bound algorithmsInternational Journal of Parallel Programming, 1976
- Branch-and-Bound Strategies for Dynamic ProgrammingOperations Research, 1976
- Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation ProblemsJournal of the ACM, 1974
- Solvable classes of discrete dynamic programmingJournal of Mathematical Analysis and Applications, 1973
- Representation theorems for equivalent optimization problemsInformation and Control, 1972
- Heuristic search viewed as path finding in a graphArtificial Intelligence, 1970
- Letter to the Editor—A Note on the Branch-and-Bound PrincipleOperations Research, 1968
- Finite-State Processes and Dynamic ProgrammingSIAM Journal on Applied Mathematics, 1967
- Branch-and-Bound Methods: A SurveyOperations Research, 1966