抄録
We introduce tractable global optimization algorithms for small boolean quadratic programming problems using reflected Gray coding technique. In the algorithms, the space complexity is limited to O(n2). Furthermore, we can implement them without multiplications or floating point operations when the instances are integers. Numerical experiments revealed that the proposed algorithms run as fast as interior point algorithms for solving convex relaxation problems of the original QPs.
