##
Branch And Bound | Set 6 (Traveling Salesman Problem)
October 13, 2016

Given a set of cities and distance between every pair of cities, the problem is to find the shortest possible tour that visits every city exactly once and returns to the starting point. For example, consider the graph shown in figure on right side. A TSP tour in the graph is 0-1-3-2-0. The cost of… Read More »