General branch and bound, and its relation to A^* and AO^*
DOI10.1016/0004-3702(84)90004-3zbMATH Open0537.68064DBLPjournals/ai/NauKK84OpenAlexW2043418025WikidataQ55924037 ScholiaQ55924037MaRDI QIDQ792768FDOQ792768
Authors: Dana S. Nau, Vipin Kumar, Laveen N. Kanal 
Publication date: 1984
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0004-3702(84)90004-3
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Search theory (90B40) Searching and sorting (68P10)
Cites Work
- Branch-and-Bound Methods: A Survey
- Branch-and-Bound Methods: General Formulation and Properties
- Title not available (Why is that?)
- 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
- A minimax algorithm better than alpha-beta?
- A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures
- 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?)
Cited In (17)
- Exact solution of two location problems via branch-and-bound
- Parallel best-first branch-and-bound in discrete optimization: a framework
- Towards an abstract parallel branch and bound machine
- Are branch and bound and A\(^{\ast}\) algorithms identical?
- Branch and Win: OR tree search algorithms for solving combinatorial optimisation problems.
- Generalized resolution search
- An efficient data structure for branch-and-bound algorithm
- Branch \& Sample: A simple strategy for constraint satisfaction
- Large-scale 0-1 linear programming on distributed workstations
- Branch-and-bound as a higher-order function
- Parallel depth first search. I: Implementation
- Generalized best first search using single and multiple heuristics
- Heuristic search in restricted memory
- A population-based fast algorithm for a billion-dimensional resource allocation problem with integer variables
- Application of the laminar Navier-Stokes equations for solving 2D and 3D pathfinding problems with static and dynamic spatial constraints: implementation and validation in Comsol Multiphysics
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- A general heuristic bottom-up procedure for searching AND/OR graphs
This page was built for publication: General branch and bound, and its relation to \(A^*\) and \(AO^*\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q792768)
