General branch and bound, and its relation to A^* and AO^*
From MaRDI portal
(Redirected from Publication:792768)
General branch and bound, and its relation to \(A^*\) and \(AO^*\)
General branch and bound, and its relation to \(A^*\) and \(AO^*\)
Recommendations
Cites work
- scientific article; zbMATH DE number 3657150 (Why is no real title available?)
- scientific article; zbMATH DE number 3690676 (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?)
- A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures
- A minimax algorithm better than alpha-beta?
- 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
- 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
(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)
