Comparative study on the variations of quantum approximate optimization algorithms to the Traveling Salesman Problem.
Wenyang QianRobert BasiliMary Eshaghian-WilnerAshfaq KhokharGlenn R. LueckeJames P. VaryPublished in: IPDPS Workshops (2023)
Keyphrases
- comparative study
- traveling salesman problem
- optimization problems
- combinatorial optimization
- combinatorial optimization problems
- combinatorial problems
- optimization methods
- evolutionary algorithm
- ant colony optimization
- discrete optimization
- knapsack problem
- nearest neighbor
- discrete particle swarm optimization
- computational complexity
- ant colony optimization algorithm
- minimum spanning tree
- discrete optimization problems
- vehicle routing problem
- benchmark problems
- global optimization
- linear program
- metaheuristic