Login / Signup
Classifying and Benchmarking Quantum Annealing Algorithms Based on Quadratic Unconstrained Binary Optimization for Solving NP-Hard Problems.
Jehn-Ruey Jiang
Chun-Wei Chu
Published in:
IEEE Access (2023)
Keyphrases
</>
np hard problems
combinatorial search
combinatorial optimization
computational complexity
optimization problems
graph coloring
quadratic program
optimization algorithm
orders of magnitude
np hard
knapsack problem
particle swarm optimization
constraint programming
combinatorial problems