What is Difference between backtracking and branch and bound method?
Backtracking[1] It is used to find all possible solutions available to the problem.[2] It traverse tree by DFS(Depth First Search).[3] It realizes that it has made a bad choice & undoes the last choice by backing up.[4] It search the state space tree until it found a solution.[5] It involves feasibility function.Branch-and-Bound (BB)[1] It is used to solve optimization problem.[2] It may traverse the tree in any manner, DFS or BFS.[3] It realizes that it already has a better optimal solution that the pre-solution leads to so it abandons that pre-solution.[4] It completely searches the state space tree to get optimal solution.[5] It involves bounding function.