1. Akgul, M. Topics in relaxation and ellipsoidal methods. Lecture Notes in Math., 97 (1984), Pitman Publ. Co.
2. Avriel, M. Nonlinear Programming: Analysis and Methods. Prentice Hall Inc. Englewood Cliffs, N.J. (1976).
3. Barahona, F. A solvable case for quadratic 0–1 programming. Discrete Appl. Math. 13 (1986), 23–26.
4. Burdet, C.A. Elements of a theory in non-convex programming. Naval Res. Log. Quarterly Vol. 24, No. 1 (1977), 47–66.
5. Chung, S.J. and Murty, K.G. A polynomially bounded ellipsoid algorithm for convex quadratic programming. Nonlinear Programming 4 (ed. O.L. Mangasarian, R.R. Meyer and S.M. Robinson), Acad. Press, (1981), 439–485.