Abstract
In this project, we investigate the Unconstrained Binary Quadratic Programming (UBQP) problem and the Boolean Quadratic Programming problem with Generalized Upper Bound constraints BQP-GUB, which belong to the computational complexity class NP-hard. Due to practical demands, researchers have shown interest in developing methods to solve these problems. To make relevant contributions, we i…