Which of the following problems is solved by using Branch and Bound method?ans.DFSBFStravelling salesman problemprim's algorithm Previous Marked for Review Next

The Branch and Bound method is used to solve the Travelling Salesman Problem.

Here's a step-by-step explanation:

1. The Travelling Salesman Problem (TSP) is a classic algorithmic problem in the field of computer science and operations research. It focuses on optimization. In this problem, a salesman is given a list of cities, and must determine the shortest route that allows him to visit each city once and return to his original location.

2. The Branch and Bound method is an algorithmic approach used to solve optimization problems, like the TSP. It involves a systematic enumeration of all candidate solutions, where large subsets of fruitless candidates are discarded en masse, by using upper and lower estimated bounds of the quantity being optimized.

3. For the TSP, the "branching" part of the method involves generating all possible routes (or a significant subset if the number of cities is large), and the "bounding" part involves calculating a lower bound on the shortest route that can be taken from a given city.

4. By systematically increasing the lower bound and using it to discard routes that cannot possibly be optimal, the method eventually finds the shortest possible route.

So, among the options given, the Travelling Salesman Problem is solved by using the Branch and Bound method.