1. An, L.T.H., Tao, P.D.: A branch and bound method via dc optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems. J. Global Optim. 13(2), 171–206 (1998)
2. Absil, P.-A., Tits, A.L.: Newton-KKT interior-point methods for indefinite quadratic programming. Comput. Optim. Appl. 36(1), 5–41 (2007)
3. Bentobache, M., Telli, M., Mokhtari, A.: A global minimization algorithm for concave quadratic programming. In: Proceedings of the 29th European Conference on Operational Research, EURO 2018, p. 329, University of Valencia, 08–11 July 2018
4. Bentobache, M., Telli, M., Mokhtari, A.: A simplex algorithm with the smallest index rule for concave quadratic programming. In: Proceedings of the Eighth International Conference on Advanced Communications and Computation, INFOCOMP 2018, pp. 88–93, Barcelona, Spain, 22–26 July 2018
5. Chinchuluun, A., Pardalos, P.M., Enkhbat, R.: Global minimization algorithms for concave quadratic programming problems. Optimization 54(6), 627–639 (2005)