Algorithms Index Page 1

Analysis of travel salesman problem

Travel salesman problem (TSP) is a very well know computer science problem which is really easy to understand but it's a NP-hard problem. The problem is about finding te shortest possible route that visits each city and returns to the origin. Here we analyze the problem and variants of it.