The travelling salesman problem and adiabatic quantum computation: an algorithm.
Tien D. KieuPublished in: Quantum Inf. Process. (2019)
Keyphrases
- preprocessing
- computational complexity
- experimental evaluation
- k means
- learning algorithm
- improved algorithm
- np hard
- cost function
- computational cost
- simulated annealing
- dynamic programming
- estimation algorithm
- optimal solution
- selection algorithm
- high accuracy
- objective function
- recognition algorithm
- theoretical analysis
- memory requirements
- path planning
- detection algorithm
- quantum computation
- feature selection
- times faster
- matching algorithm
- significant improvement
- computationally efficient
- probabilistic model
- genetic algorithm
- data structure
- evolutionary algorithm