You're currently viewing an old version of this dataset. To see the current version, click here.

Traveling Salesman Problem

The Traveling Salesman Problem (TSP) is a classic problem in combinatorial optimization and operations research that involves finding the shortest possible tour that visits each city exactly once and returns to the starting city.

Data and Resources

Cite this as

Imanol Echeverria, Maialen Murua, Roberto Santana (2024). Dataset: Traveling Salesman Problem. https://doi.org/10.57702/pyovgsmb

DOI retrieved: December 3, 2024

Additional Info

Field Value
Created December 3, 2024
Last update December 3, 2024
Defined In https://doi.org/10.48550/arXiv.2403.09249
Author Imanol Echeverria
More Authors
Maialen Murua
Roberto Santana