Performance of hybrid quantum/classical variational heuristics for combinatorial optimization.
Giacomo NanniciniPublished in: CoRR (2018)
Keyphrases
- combinatorial optimization
- exact algorithms
- metaheuristic
- quantum computation
- simulated annealing and tabu search
- combinatorial optimization problems
- traveling salesman problem
- simulated annealing
- optimization problems
- quantum mechanics
- branch and bound
- combinatorial problems
- branch and bound algorithm
- mathematical programming
- hard combinatorial optimization problems
- quadratic assignment problem
- image segmentation
- graph theory
- search algorithm
- quantum probability
- single machine scheduling problem
- memetic algorithm
- path relinking
- tabu search
- vehicle routing problem
- greedy algorithm
- np complete
- scheduling problem
- neural network