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

DOI10.1016/S0004-3702(83)80009-5MaRDI QIDQ1837544zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• scientific article; zbMATH DE number 3657150 (Why is no real title available?)
• scientific article; zbMATH DE number 3573250 (Why is no real title available?)
• scientific article; zbMATH DE number 3303642 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• scientific article; zbMATH DE number 3331276 (Why is no real title available?)
• A minimax algorithm better than alpha-beta?
• A minimax algorithm better than alpha-beta? Yes and no
• An analysis of alpha-beta pruning
• Branch-and-Bound Methods: A Survey
• Branch-and-Bound Methods: General Formulation and Properties
• Branch-and-bound procedure and state—space representation of combinatorial optimization problems
• Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems
• Letter to the Editor—A Note on the Branch-and-Bound Principle
• On the optimality of algorithms for finite state sequential decision processes
• Optimizing decision trees through heuristically guided search
• The Power of Dominance Relations in Branch-and-Bound Algorithms

Cited in

(13)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1837544)