General branch and bound, and its relation to \(A^*\) and \(AO^*\)

DOI10.1016/0004-3702(84)90004-3zbMath0537.68064OpenAlexW2043418025WikidataQ55924037 ScholiaQ55924037MaRDI QIDQ792768

Vipin Kumar, Dana S. Nau, 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

zbMATH Keywords

Branch and boundheuristic search procedures

Mathematics Subject Classification ID

Searching and sorting (68P10) Search theory (90B40) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

A general heuristic bottom-up procedure for searching AND/OR graphs, Parallel depth first search. I: Implementation, Branch \& Sample: A simple strategy for constraint satisfaction, Branch-and-bound as a higher-order function, Generalized best first search using single and multiple heuristics, 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, A population-based fast algorithm for a billion-dimensional resource allocation problem with integer variables, Branch and Win: OR tree search algorithms for solving combinatorial optimisation problems., An efficient data structure for branch-and-bound algorithm, Heuristic search in restricted memory, Large-scale 0-1 linear programming on distributed workstations

Cites Work

• 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 general branch and bound formulation for understanding and synthesizing And/Or tree search procedures
• 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
• Branch-and-Bound Methods: General Formulation and Properties