| Backtracking is used to solve decision problems |
Branch and bound are used to solve optimization problems |
| Backtracking is traced by DFS |
Branch and Bound are traced by BFS and DFS |
| Backtracking contains the feasibility function. |
Branch and Bound contain the bounding function. |
| Backtracking is more efficient. |
Branch-and-Bound is less efficient. |
Applications:
- N Queen Problem,
- Graph coloring problem,
- Hamiltonian cycle problem,
- Knapsack Problem,
- Sum of subsets problem
|
Applications:
- Job sequencing problem
- Traveling salesman problem
- Knapsack problem
|
