Branch & Bound (B&B) Search

• is a general method to solve discrete optimization problems
• it explores branches of this tree, which represent subsets of the solution set. Before enumerating the candidate solutions of a branch, the branch is checked against upper and lower estimated bounds on the optimal solution and is discarded if it cannot produce a better solution than the best one found so far by the algorithm

Subpages

• Branch And Bound (B&B) - optimization problems
• Branch & Bound (B&B) Search - Solving Probabilistic Inference Queries