Comparison Between Backtracking and Branch and Bound Methods.

 

 

Branch and Bound Method	BackTracking Method
In this technique, any of the search methods among the depth first search or breadth first search can be used to get the optimum solution.	In this technique , the solutions will be obtained using the DFS (depth first search)method.
This method is used to provide/solve optimization problems.	This method Provides solutions to the decision problems effectively.
Here in this method there is no chance of getting the bad solutions.	Here in this method there is chance of getting the bad solutions in sometimes.
By using technique, we can generate the SST (State Space Tree) and can be searched completely.	By using this method SST (State Space Tree) and can’t be searched completely.
Hence there is a possibility of getting an optimum solution at any point in the state space tree.	Hence the process of  searching terminates as soon as the solutions obtained.
This method is applied to the problems like Travelling Sales –person(TSP),job sequencing etc.,	This method can be used on problems like Graph-Coloring, Sum-of-Subsets and N-queens.