T. Achterberg, Scip : solving constraint integer programs, Mathematical Programming Computation, issue.1, pp.1-41, 2009.

C. S. Adjiman, S. Dallwig, C. A. Floudas, and A. Neumaier, A global optimization method, ?bb, for general twice-differentiable constrained nlpsi. theoretical advances, Computers and Chemical Engineering, vol.22, issue.9, pp.1137-1158, 1998.

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.

M. Anthony, E. Boros, Y. Crama, and A. Gruber, Quadratic reformulations of nonlinear binary optimization problems, Mathematical Programming, vol.162, pp.115-144, 2017.

P. Belotti, J. Lee, L. Liberti, F. Margot, and A. Wächter, Br anching and bounds tightening techniques for nonconvex minlp, Optimization Methods and Software, issue.24, pp.597-634, 2009.

A. Billionnet, S. Elloumi, A. Lambert, and A. Wiegele, Using a Conic Bundle method to accelerate both phases of a Quadratic Convex Reformulation, INFORMS Journal on Computing, vol.29, issue.2, pp.318-331, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01811329

B. Borchers, A. Csdp, . C-library-for-semidefinite, and . Programming, Optimization Methods and Software, vol.11, issue.1, pp.613-623, 1999.

C. Buchheim and C. , Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization, Journal of Global Optimization, pp.1-28, 2016.

E. Dalkiran and L. Ghalami, On linear programming relaxations for solving polynomial programming problems, Computers & Operations Research, vol.99, pp.67-77, 2018.

A. Sourour-elloumi, A. Lambert, and . Lazare, Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation, 2018.

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

W. H. Freeman, , 1979.

C. Helmberg, Conic Bundle, 2011.

. Ibm-ilog,

, IBM ILOG CPLEX 12.7 Reference Manual, 2017.

J. B. Lasserre, Global optimization with polynomials and the problem of moments, SIAM Journal on Optimization, vol.11, issue.3, pp.796-817, 2001.

J. B. Lasserre and T. P. Thanh, Convex underestimators of polynomials, Journal of Global Optimization, pp.1-25, 2013.

R. Misener and C. A. Floudas, Antigone: algorithms for continuous/integer global optimization of nonlinear equations, Journal of Global Optimization, vol.59, issue.2-3, pp.503-526, 2014.

N. V. Sahinidis and M. Tawarmalani, Baron 9.0.4: Global optimization of mixed-integer nonlinear programs. User's Manual, 2010.

J. Sturm, Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. OPTMS, pp.625-653, 1999.