Embedding All Feasible Solutions of Traveling Salesman Problem by Divide-and-Conquer Quantum Search.
Rei SatoKazuhiro SaitoTetsuro NikuniShohei WatabePublished in: QCE (2023)
Keyphrases
- traveling salesman problem
- feasible solution
- valid inequalities
- solution space
- tabu search
- variable neighborhood search
- search algorithm
- ant colony optimization
- linear programming
- optimization problems
- objective function
- combinatorial optimization
- search space
- vehicle routing problem
- benchmark instances
- hamiltonian cycle
- optimal solution
- linear programming relaxation
- lagrangian relaxation
- traveling salesman
- solution quality
- mathematical model
- integer programming
- aco algorithm
- convex hull
- mixed integer
- special case
- global optimization
- simulated annealing
- neural network
- linear program