← all datasets

Traveling Salesman Problem

Emerging
2papers using it
2022first seen

The Traveling Salesman Problem (TSP) is a combinatorial optimization problem that involves finding the shortest possible route that visits a set of cities and returns to the origin city, and it is used to evaluate learning-based approaches for routing problems.

🔎 Find this dataset

Papers using Traveling Salesman Problem (2)

Traveling Salesman Problem — datasets — graph-learning