Solving QUBO problems with cP systems
摘要
P systems with compound terms (cP systems) have been proposed by Radu Nicolescu in 2018. These expressive cP systems have been used to solve well-known NP-complete problems efficiently, such as the Hamiltonian path, traveling salesman, 3-coloring, and software verification problems. In this paper, we use cP systems to provide an efficient parallel solution to the integer-valued quadratic unconstrained Boolean optimization (QUBO) problem.