W. P. Adams and H. D. Sherali, Reformulation linearization technique for discrete optimization problems, Handbook of Combinatorial Optimization, pp.2849-2896, 2013.

F. A. Al-khayyal, C. Larsen, and T. Van-voorhis, A relaxation method for nonconvex quadratically constrained programs, Journal of Global Optimization, vol.6, pp.215-230, 1995.

M. F. Anjos and J. B. Lasserre, Handbook of semidefinite, conic and polynomial optimization: Theory, algorithms, software and applications, International Series in Operational Research and Management Science, vol.166, 2012.

C. Audet, P. Hansen, B. Jaumard, and G. Savard, A branch and cut algorithm for non-convex quadratically constrained quadratic programming, Mathematical Programming, vol.87, issue.1, pp.131-152, 2000.

C. Audet, P. Hansen, and G. Savard, Essays and surveys in global optimization, GERAD 25th Anniversary Series, 2005.

X. Bao, N. V. Sahinidis, and M. Tawarmalani, Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons, vol.129, pp.129-157, 2011.

A. Billionnet, S. Elloumi, and A. Lambert, Linear reformulations of integer quadratic programs, MCO 2008, pp.43-51, 2008.
URL : https://hal.archives-ouvertes.fr/hal-01125562

A. Billionnet, S. Elloumi, and A. Lambert, Extending the QCR method to the case of general mixed integer program, Mathematical Programming, vol.131, issue.1, pp.381-401, 2012.

B. Borchers, Csdp, a c library for semidefinite programming, Optimization Methods and Software, vol.11, issue.1, pp.613-623, 1999.

C. Buchheim and A. Wiegele, Semidefinite relaxations for non-convex quadratic mixed-integer programming, Mathematical Programming, pp.435-452, 2013.

S. Burer and A. Letchford, Non-convex mixed-integer nonlinear programming: a survey, Surveys in Oper. Res. and Mgmt. Sci, vol.17, issue.2, pp.97-106, 2012.

C. A. Floudas, Deterministic Global Optimization, 2000.

M. R. Garey and D. S. Johnson, Computers and Intractability: A guide to the theory of NP-Completness, 1979.

. Ibm-ilog, Ibm ilog cplex 12.5 reference manual, 2013.

A. Lambert, IQCP/MIQCP: Library of Integer and Mixed-Integer Quadratic Quadratically Constrained Programs, 2013.

L. Liberti and N. Maculan, Global optimization: From theory to implementation, chapter: Nonconvex optimization and its applications, 2006.

J. Linderoth, A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs, Mathematical Programming, vol.103, pp.251-282, 2005.

G. P. Mccormick, Computability of global solutions to factorable non-convex programs: Part i -convex underestimating problems, Mathematical Programming, vol.10, issue.1, pp.147-175, 1976.

R. Misener and C. A. Floudas, Global optimization of mixed-integer quadraticallyconstrained quadratic programs (MIQCQP) through piecewise-linear and edgeconcave relaxations, Mathematical Programming, vol.136, pp.155-182, 2012.

R. Misener and C. A. Floudas, GloMIQO: Global mixed-integer quadratic optimizer, Journal of Global Optimization, vol.57, issue.1, pp.3-50, 2013.

U. Raber, A simplicial branch-and-bound method for solving nonconvex allquadratic programs, Journal of Global Optimization, vol.13, pp.417-432, 1998.

A. Saxena, P. Bonami, and J. Lee, Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations, Mathematical Programming, vol.130, pp.359-413, 2011.

M. Tawarmalani and N. V. Sahinidis, Convexification and global optimization in continuous and mixed-integer nonlinear programming, 2002.

M. Tawarmalani and N. V. Sahinidis, A polyhedral branch-and-cut approach to global optimization, Mathematical Programming, vol.103, issue.2, pp.225-249, 2005.