Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems

Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems | Litlas