A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures
From MaRDI portal
Publication:1837544
DOI10.1016/S0004-3702(83)80009-5zbMATH Open0507.68062OpenAlexW2009029907MaRDI QIDQ1837544FDOQ1837544
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
Cites Work
- Title not available (Why is that?)
- Branch-and-Bound Methods: A Survey
- Branch-and-Bound Methods: General Formulation and Properties
- An analysis of alpha-beta pruning
- Title not available (Why is that?)
- Optimizing decision trees through heuristically guided search
- Title not available (Why is that?)
- The Power of Dominance Relations in Branch-and-Bound Algorithms
- Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems
- Letter to the Editor—A Note on the Branch-and-Bound Principle
- A minimax algorithm better than alpha-beta?
- On the optimality of algorithms for finite state sequential decision processes
- Branch-and-bound procedure and state—space representation of combinatorial optimization problems
- Title not available (Why is that?)
- A minimax algorithm better than alpha-beta? Yes and no
- Title not available (Why is that?)
Cited In (13)
- The application of automated reasoning to formal models of combinatorial optimization
- The \(PN^{*}\)-search algorithm: Application to tsume-shogi
- Trends in game tree search
- Towards an abstract parallel branch and bound machine
- A minimax algorithm better than alpha-beta? Yes and no
- Branch and Win: OR tree search algorithms for solving combinatorial optimisation problems.
- General branch and bound, and its relation to \(A^*\) and \(AO^*\)
- Branch-and-bound as a higher-order function
- Parallel depth first search. I: Implementation
- The complexity of a simple stochastic OR-tree model in which ``directional search is bad
- Game tree algorithms and solution trees
- A generalization of alpha-beta and \(SSS^*\) search procedures
- A general heuristic bottom-up procedure for searching AND/OR graphs
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)
