1. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. WH Freeman. Co., New York (1979)
2. Mcbride, R.D., Yormark, J.S.: An implicit enumeration algorithm for quadratic integer programming. Manage. Sci. 26, 282–296 (1980)
3. Chardaire, P., Sutter, A.: A decomposition method for quadratic zero-one programming. J. Manage. Sci. 41, 704–712 (1995)
4. Li, D., Sun, X.L.: Nonlinear Integer Programming. Springer, New York (2006).
https://doi.org/10.1007/0-387-32995-1
5. Helmberg, C., Rendl, F.: Solving quadratic (0,1)-problems by semidefinite programs and cutting planes. Math. Program. 82, 291–315 (1998)