L. Liberti, Linearity Embedded in Nonconvex Programs, Journal of Global Optimization, vol.23, issue.5, pp.157-196, 2005.
DOI : 10.1007/s10898-004-0864-2

L. Liberti and C. Pantelides, An Exact Reformulation Algorithm for Large Nonconvex NLPs Involving Bilinear Terms, Journal of Global Optimization, vol.3, issue.10, pp.161-189, 2006.
DOI : 10.1007/s10898-006-9005-4

L. Liberti, Compact linearization for binary quadratic problems, 4OR, vol.68, issue.10, pp.231-245, 2007.
DOI : 10.1007/s10288-006-0015-3

H. Sherali and A. Alameddine, A new reformulation-linearization technique for bilinear programming problems, Journal of Global Optimization, vol.21, issue.3, pp.379-410, 1992.
DOI : 10.1007/BF00122429

H. Sherali and C. Tuncbilek, A global optimization algorithm for polynomial programming problems using a Reformulation-Linearization Technique, Journal of Global Optimization, vol.3, issue.1, pp.101-112, 1991.
DOI : 10.1007/BF00121304

H. Sherali and H. Wang, Global optimization of nonconvex factorable programming problems, Mathematical Programming, vol.89, issue.3, pp.459-478, 2001.
DOI : 10.1007/PL00011409

H. Sherali and C. Tuncbilek, New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems, Operations Research Letters, vol.21, issue.1, pp.1-9, 1997.
DOI : 10.1016/S0167-6377(97)00013-8

H. Sherali, E. Dalkiran, and L. Liberti, Reduced RLT representations for nonconvex polynomial programming problems, Journal of Global Optimization, vol.103, issue.1
DOI : 10.1007/s10898-011-9757-3

G. Mccormick, Computability of global solutions to factorable nonconvex programs: Part I ??? Convex underestimating problems, Mathematical Programming, vol.17, issue.11, pp.146-175, 1976.
DOI : 10.1287/mnsc.17.11.759

F. Al-khayyal and J. Falk, Jointly Constrained Biconvex Programming, Mathematics of Operations Research, vol.8, issue.2, pp.273-286, 1983.
DOI : 10.1287/moor.8.2.273

Y. Jiao, F. Stillinger, and S. Torquato, Geometrical ambiguity of pair statistics: Point configurations, Physical Review E, vol.81, issue.1, p.arXiv, 2009.
DOI : 10.1103/PhysRevE.81.011105

A. Rikun, A convex envelope formula for multilinear functions, Journal of Global Optimization, vol.10, issue.4, pp.425-437, 1997.
DOI : 10.1023/A:1008217604285

T. Christof and A. Löbel, The porta manual page, 1997.

E. Smith and C. Pantelides, A symbolic reformulation/spatial branch-and-bound algorithm for the global optimisation of nonconvex MINLPs, Computers & Chemical Engineering, vol.23, issue.4-5, pp.457-478, 1999.
DOI : 10.1016/S0098-1354(98)00286-5

C. Adjiman, S. Dallwig, C. Floudas, and A. Neumaier, A global optimization method, ??BB, for general twice-differentiable constrained NLPs ??? I. Theoretical advances, Computers & Chemical Engineering, vol.22, issue.9, pp.1137-1158, 1998.
DOI : 10.1016/S0098-1354(98)00027-1

N. Sahinidis and M. Tawarmalani, BARON 7.2.5: Global Optimization of Mixed- Integer Nonlinear Programs, User's Manual, 2005.

L. Liberti, Writing global optimization software Global Optimization: from Theory to Implementation, pp.211-262, 2006.

P. Belotti, J. Lee, L. Liberti, F. Margot, and A. Wächter, Branching and bounds tighteningtechniques for non-convex MINLP, Optimization Methods and Software, vol.24, issue.4-5, pp.597-634, 2009.
DOI : 10.1080/10556780903087124

S. Cafieri, J. Lee, and L. Liberti, On convex relaxations of quadrilinear terms, Journal of Global Optimization, vol.99, issue.2, pp.661-685, 2010.
DOI : 10.1007/s10898-009-9484-1

C. Meyer and C. Floudas, Trilinear Monomials with Positive or Negative Domains: Facets of the Convex and Concave Envelopes, Frontiers in Global Optimization, pp.327-352, 2003.
DOI : 10.1007/978-1-4613-0251-3_18

C. Meyer and C. Floudas, Trilinear Monomials with Mixed Sign Domains: Facets of the Convex and Concave Envelopes, Journal of Global Optimization, vol.29, issue.2, pp.125-155, 2004.
DOI : 10.1023/B:JOGO.0000042112.72379.e6

L. Liberti and C. Pantelides, Convex envelopes of monomials of odd degree, Journal of Global Optimization, vol.25, issue.2, pp.157-168, 2003.
DOI : 10.1023/A:1021924706467

M. Katzman, Counting Monomials, Journal of Algebraic Combinatorics, vol.22, issue.3, pp.331-341, 2005.
DOI : 10.1007/s10801-005-4531-6

F. Messine and J. Lagouanelle, Enclosure methods for multivariate differentiable functions and application to global optimization, Journal of Universal Computer Science, vol.4, issue.6, pp.589-603, 1998.

P. Belotti, S. Cafieri, J. Lee, and L. Liberti, Feasibility-Based Bounds Tightening via Fixed Points, LNCS, vol.6508, issue.COCOA10, pp.65-76, 2010.
DOI : 10.1007/978-3-642-17458-2_7

URL : https://hal.archives-ouvertes.fr/hal-00979219

C. Berge, TWO THEOREMS IN GRAPH THEORY, Proceedings of the National Academy of Sciences, vol.43, issue.9, pp.842-844, 1957.
DOI : 10.1073/pnas.43.9.842

C. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, 1998.