← all datasets

Asymmetric Traveling Salesperson Problem (ATSP)

Emerging
1papers using it
2024first seen

The Asymmetric Traveling Salesperson Problem (ATSP) is a combinatorial optimization problem that involves finding the shortest possible route for a salesperson to visit a set of cities with given distances that vary depending on the direction of travel, and it is used to evaluate the performance of optimization algorit

🔎 Find this dataset

Papers using Asymmetric Traveling Salesperson Problem (ATSP) (1)

Asymmetric Traveling Salesperson Problem (ATSP) dataset — papers, benchmarks & downloads · Quantum Computing