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

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, Compact linearization for binary quadratic problems, 4OR, vol.68, issue.10, pp.231-245, 2007.
DOI : 10.1007/s10288-006-0015-3

L. Liberti and C. 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

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

C. A. Meyer and C. A. 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

H. D. 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