Travelling Salesman Problem using Branch and Bound approach

In this article we will briefly discuss about the travelling salesman problem and the branch and bound method to solve the same.

What is the problem statement ?

Travelling Salesman Problem is based on a real life scenario, where a salesman from a company has to start from his own city and visit all the assigned cities exactly once and return to his home till the end of the day. The exact problem statement goes like this,

"Given a set of cities and distance between every pair of cities, the probl...