Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems
Journal of the ACM (JACM)
The Power of Dominance Relations in Branch-and-Bound Algorithms
Journal of the ACM (JACM)
Optimizing decision trees through heuristically guided search
Communications of the ACM
Problem-Solving Methods in Artificial Intelligence
Problem-Solving Methods in Artificial Intelligence
IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
Branch & bound formulation for sequential and parallel game tree searching: preliminary results
IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 1
IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence
A minimax algorithm better than alpha-beta? Yes and No
Artificial Intelligence
Coping with anomalies in parallel branch-and-bound algorithms
IEEE Transactions on Computers - The MIT Press scientific computation series
Assessment of the Benefit of Redundant Systems
SAFECOMP '02 Proceedings of the 21st International Conference on Computer Safety, Reliability and Security
Game Tree Algorithms and Solution Trees
CG '98 Proceedings of the First International Conference on Computers and Games
On multiprocessor task scheduling using efficient state space search approaches
Journal of Parallel and Distributed Computing
A minimax algorithm better than alpha-beta? Yes and No
Artificial Intelligence
Agent-oriented programming: from prolog to guarded definite clauses
Agent-oriented programming: from prolog to guarded definite clauses
Robust planning in uncertain environments
UAI'94 Proceedings of the Tenth international conference on Uncertainty in artificial intelligence
| Hi-index | 0.00 |
Citing the confusing statements in the AI literature concerning the relationship between branch and bound (B&B) and heuristic search procedures were present a simple and general formulation of B&B which should help dispel much of the confusion. We illustrate the utility of the formulation by showing that through it some apparently very different algorithms for searching And/Or trees reveal the specific nature of their similarities and differences. In addition to giving new insights into the relationships among some AI search algorithms, the general formulation also provides suggestions on how existing search procedures may be varied to obtain new algorithms.