Mapping NP-hard and NP-complete optimisation problems to Quadratic Unconstrained Binary Optimisation problems.
Bas LodewijksPublished in: CoRR (2019)
Keyphrases
- optimisation problems
- np complete
- np hard
- optimisation algorithm
- evolutionary computation
- computational complexity
- particle swarm
- particle swarm optimisation
- benchmark problems
- randomly generated
- constraint satisfaction problems
- ant colony optimisation
- polynomially solvable
- satisfiability problem
- lower bound
- scheduling problem
- swarm intelligence
- optimal solution
- test suite
- approximation algorithms
- branch and bound algorithm
- conjunctive queries
- constraint problems
- evolutionary algorithm
- decision problems
- worst case
- constraint satisfaction
- multi objective
- special case
- genetic algorithm
- data sets
- genetic programming
- search algorithm
- phase transition
- hybrid algorithm
- simulated annealing
- optimization problems