A general bottom-up procedure for searching and/or graphs

A note on two problems in connexion with graphs

1959 • 22,492 citations

Principles of Artificial Intelligence

1982 • 3,384 citations

A generalization of Dijkstra's algorithm

1977 • 263 citations

The B∗ tree search algorithm: A best-first proof procedure

1979 • 189 citations

A minimax algorithm better than alpha-beta?

1979 • 183 citations

Branch-and-Bound Strategies for Dynamic Programming

1976 • 173 citations

On the complexity of admissible search algorithms

1977 • 159 citations

Optimizing decision trees through heuristically guided search

1978 • 150 citations

The Art and Theory of Dynamic Programming

1979 • 129 citations

Additive AND/OR graphs

1973 • 118 citations

A general branch and bound formulation for understanding and synthesizing and/or tree search procedures

1983 • 87 citations

Parallel Branch-and-Bound Formulations for AND/OR Tree Search

1984 • 83 citations

General Branch and Bound, and its relation to A∗ and AO∗

1984 • 82 citations

Dynamic Programming as Graph Searching: An Algebraic Approach

1981 • 44 citations

Equivalence between AND/OR graphs and context-free grammars

1973 • 36 citations

Solvable classes of discrete dynamic programming

1973 • 32 citations

Branch-and-bound and beyond

1971 • 22 citations

A unified approach to problem solving search procedures

1982 • 14 citations

The composite decision process: a unifying formulation for heuristic search, dynamic programming and branch & bound procedures

1983 • 8 citations

Some remarks on heuristic search algorithms

1981 • 6 citations