Traveling Salesperson Problem (TSP)

The Traveling Salesperson 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 heuristic state preparation routines in quantum algorithms.

Papers using Traveling Salesperson Problem (TSP) (3)

Improving Quantum and Classical Decomposition Methods for Vehicle Routing2024 · 3 citesSolving Combinatorial Optimization Problems with a Block Encoding Quantum Optimizer2024Direct phase encoding in QAOA: Describing combinatorial optimization problems through binary decision variables2024