Skip to main content


Traveling Salesman Problem

Suppose a salesman plans to visit a set of cities. The classical formulation of the Traveling Salesman Problem (TSP) is as follows. 

Given a set of cities and a set of distances between the cities, find the route of the minimal length that visits each city exactly once and returns to the initial city.

The TSP is one of the most well-studied problems in combinatorial optimization thanks both to its theoretical importance and its applications in many important fields such as logistics, genome sequencing, and data clustering.

Learning Resources:

This youtube video contains a well-explained introductory material about the basic methods for solving the TSP


Please see the downloads page to access TSP solvers.