What is B&B?????
- Branch and Bound is a systematic method to solve NP-hard optimization problems
- B&B is a rather general optimization technique that applies where the greedy method and synamic programming fails
- The general idea of B&B is a BFS-like search for the optimal solution, but not all the nodes get expanded
