The Branch and Bound (B&B) algorithm is a general method to solve discrete optimization problems B&B Solvers Types Branch And Bound (B&B) - On Finite Domain Branch And Bound (B&B) - On Infinite Domain Other Resources