Traveling Salesman Problem
Given a set of cities and distance between every pair of cities the problem is to find the shortest possible route that visits every city exactly once and returns to the starting point. Travelling salesman problem is the most notorious computational problem. Multiple Traveling Salesman Problem Np Hard 50 Points With 2 It is most easily expressed as a graph describing the locations of a set of nodes. Traveling salesman problem . The problem is to find a path that visits each city once returns to the starting city and minimizes the distance traveled. The travelling salesman problem was mathematically formulated in the 1800s by the irish mathematician w r. Hamilton and by the british mathematician thomas kirkman hamilton s icosian game was a recreational puzzle based on finding a hamiltonian cycle. The traveling salesman problem is a problem in graph theory requiring the most efficient i e least total distance hamiltonian cycle a salesman can take through each of cities. The ...