Mapping NP-hard and NP-complete optimisation problems to Quadratic Unconstrained Binary Optimisation problems
share
We discuss several mappings from well-known NP-hard problems to Quadratic Unconstrained Binary Optimisation problems which are treated incorrectly by Lucas in <cit.>. We provide counterexamples and correct the mappings. We also extend the body of QUBO formulations of NP-complete and NP-hard optimisation problems by discussing additional problems.
READ FULL TEXT
