6-city TSP

Emerging

1papers using it

2025first seen

The '6-city TSP' refers to a specific instance of the Traveling Salesman Problem involving six cities, used to evaluate the effectiveness of various encoding techniques for solving TSP on quantum computers.

🔎 Find this dataset

Papers using 6-city TSP (1)

An edge-based and subspace reduction encoding scheme to solve the traveling salesman problem in quantum computers2025