1. Anstreicher, K., 1998. On the equivalence of convex programming bounds for boolean quadratic programming. Unpublished.
2. A solvable case of quadratic 0–1 programming;Barahona;Discret. Appl. Math.,1986
3. Heuristic Algorithms for the Unconstrained Binary Quadratic Programming Problem;Beasley,1998
4. A solvable class of quadratic 0–1 programming;Chakradhar;Discret. Appl. Math.,1992
5. A decomposition method for quadratic zero-one programming;Chardaire;Manag. Sci.,1995