A General Branch-and-Bound Formulation for AND/OR Graph and Game Tree Search
- 1 January 1988
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Three approaches to heuristic search in networksJournal of the ACM, 1985
- Admissible heuristic search in and/or graphsTheoretical Computer Science, 1983
- A general branch and bound formulation for understanding and synthesizing and/or tree search proceduresArtificial Intelligence, 1983
- Search Algorithms Under Different Kinds of Heuristics—A Comparative StudyJournal of the ACM, 1983
- The B∗ tree search algorithm: A best-first proof procedureArtificial Intelligence, 1979
- 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 complexity of admissible search algorithmsArtificial Intelligence, 1977
- An analysis of alpha-beta pruningArtificial Intelligence, 1975
- Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation ProblemsJournal of the ACM, 1974