Quantum optimization for GTSP yields competitive solutions on small instances but shows higher runtimes and sharp drops in feasibility and scalability on larger graphs compared to classical solvers.
A transformation technique for the clustered generalized traveling salesman problem with applications to logistics.European Journal of Operational Research, 285(2):444–457
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Quantum Optimization Methods for the Generalized Traveling Salesman Problem
Quantum optimization for GTSP yields competitive solutions on small instances but shows higher runtimes and sharp drops in feasibility and scalability on larger graphs compared to classical solvers.