About this document
Overview of Branch and Bound Algorithm by ABHISHEK DAS is a document available to read on EtoBox.
The Branch and Bound (B&B) algorithm is a systematic method for solving optimization problems by using a state space tree. It applies where greedy and dynamic programming methods fail. B&B uses a bounding function to compute a bound for the objective function value at each node, allowing it to determine if the node is promising or not promising without fully exploring it. If the bound is better than the best solution found so far, the node is promising and expanded; otherwise, it is not promising and pruned
- Author
- ABHISHEK DAS
- Language
- EN