Traveling Salesman Problem
Emerging9papers using it
2024first seen
The Traveling Salesman Problem 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 different optimization formulations and algorithms.
Papers using Traveling Salesman Problem (9)
- Warm-Starting PCE for Traveling Salesman ProblemLocally Acting Grover Mixers for Constraint-Preserving QAOAEncoding Matters: Benchmarking Binary and D-ary Representations for Quantum Combinatorial OptimizationComparing performance of variational quantum algorithm simulations on HPC systemsCutting Slack: Quantum Optimization With Slack-free Methods For Combinatorial BenchmarksTransfer learning of optimal QAOA parameters in combinatorial optimizationEfficient Internal Strategies in Quantum Relaxation based
Branch-and-BoundA practical applicable quantum-classical hybrid ant colony algorithm for
the NISQ eraQOPTLib: a Quantum Computing Oriented Benchmark for Combinatorial
Optimization Problems