Solving the traveling salesman problem via different quantum computing architectures

DOI10.1142/S0219749925400039MaRDI QIDQ7250220zbMATH OpenFDO

Authors Venkat Aneesh Padmasola, Zhaotong Li, Rupak Chatterjee, Wesley Dyk

Publication date 20 May 2026

Published in International Journal of Quantum Information (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0219749925400039

zbMATH Keywords

graph optimizationoptical computingquantum algorithmsquantum computing

Mathematics Subject Classification ID

Quantum theory (81-XX)

Cites work

• A hybrid algorithm for the DNA sequencing problem
• Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
• Optimization on large interconnected graphs and networks using adiabatic quantum computation
• Solving Airline Crew Scheduling Problems by Branch-and-Cut

This page was built for publication: Solving the traveling salesman problem via different quantum computing architectures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7250220)