A tight bound for the boolean quadratic optimization problem and its use in a branch and bound algorithm 1

Known duality statements are used to find tight bounds for the branch and bound process in solving Boolean quadratic optimization problems. To solve the corresponding continuous partial problem, a NEWTON-like procedure is indicated. Superlinear convergence, however, is only obtained in partial cases.