A simple polynomial-time algorithm for convex quadratic programming

Polynomial Time Weak Approximation Algorithms for Quadratic Programming

An effective branch-and-bound algorithm for convex quadratic integer programming

An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming

Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation

Quadratic convex reformulations for quadratic 0–1 programming

Polynomial time solvable algorithms to a class of unconstrained and linearly constrained binary quadratic programming problems