A general branch and bound formulation for understanding and synthesizing and/or tree search procedures
- 31 March 1983
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 21 (1-2) , 179-198
- https://doi.org/10.1016/s0004-3702(83)80009-5
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- The B∗ tree search algorithm: A best-first proof procedureArtificial Intelligence, 1979
- Optimizing decision trees through heuristically guided searchCommunications of the ACM, 1978
- Branch-and-bound procedure and state—space representation of combinatorial optimization problemsInformation and Control, 1978
- The Power of Dominance Relations in Branch-and-Bound AlgorithmsJournal of the ACM, 1977
- On the optimality of algorithms for finite state sequential decision processesJournal of Mathematical Analysis and Applications, 1976
- An analysis of alpha-beta pruningArtificial Intelligence, 1975
- Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation ProblemsJournal of the ACM, 1974
- ErrataOperations Research, 1968
- Letter to the Editor—A Note on the Branch-and-Bound PrincipleOperations Research, 1968
- Branch-and-Bound Methods: A SurveyOperations Research, 1966