The traveling salesman problem (TSP) is a widely studied combinatorial optimization problem, which, given a set of cities and a cost to travel from one city to another, seeks to identify the tour that will allow a salesman to visit each city only once, starting and ending in the same city, at the minimum cost.

Last modified

• 11/29/2018

Creator

• Jessica Yu

DOI

• https://doi.org/10.21985/N2546Q

Keyword

• Game Theory
• Travelling Salesman

Rights statement

• In Copyright