#11 Branch and Bound (BFS traversing)

[jimin-kiim]

Design Approaches

1. Brute Force
2. Divide and Conquer
3. Dynamic Programming
4. Greedy
5. Backtracking (DFS)
6. Branch and Bound (BFS)
7. Approximation

Backtracking ? or Branch and Bound ?

• if an effective h-value can be found, it's better to use Branch and Bound rather than Backtracking
• since it can prune earlier near the root node
• being proficient, using B&B would be much better so persistent practice is needed

Branch and Bound

• Non-Optimization Problems
  • N-queens Problem, Subset Sum Problem
• Optimization Problems
  • 0/1 KnapSack Problem, Traveling Salesman Problem
  • need bounding function (f = g + h) to find upper bound / lower bound