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

DOI10.1016/S0004-3702(83)80009-5zbMath0507.68062OpenAlexW2009029907MaRDI QIDQ1837544

Vipin Kumar, Laveen N. Kanal

Publication date: 1983

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0004-3702(83)80009-5

zbMATH Keywords

algorithms for searching And/Or trees

Mathematics Subject Classification ID

Searching and sorting (68P10) Search theory (90B40) Artificial intelligence (68T99)

Related Items (11)

A generalization of alpha-beta and \(SSS^*\) search procedures ⋮ A general heuristic bottom-up procedure for searching AND/OR graphs ⋮ Parallel depth first search. I: Implementation ⋮ The complexity of a simple stochastic OR-tree model in which ``directional search is bad ⋮ Branch-and-bound as a higher-order function ⋮ Branch and Win: OR tree search algorithms for solving combinatorial optimisation problems. ⋮ The \(PN^{*}\)-search algorithm: Application to tsume-shogi ⋮ A minimax algorithm better than alpha-beta? Yes and no ⋮ General branch and bound, and its relation to \(A^*\) and \(AO^*\) ⋮ Game tree algorithms and solution trees ⋮ The application of automated reasoning to formal models of combinatorial optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A minimax algorithm better than alpha-beta?
• On the optimality of algorithms for finite state sequential decision processes
• An analysis of alpha-beta pruning
• A minimax algorithm better than alpha-beta? Yes and no
• The Power of Dominance Relations in Branch-and-Bound Algorithms
• Branch-and-bound procedure and state—space representation of combinatorial optimization problems
• Optimizing decision trees through heuristically guided search
• Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems
• Branch-and-Bound Methods: A Survey
• Letter to the Editor—A Note on the Branch-and-Bound Principle
• Branch-and-Bound Methods: General Formulation and Properties

This page was built for publication: A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures