{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T04:18:37Z","timestamp":1772770717814,"version":"3.50.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,5,10]],"date-time":"2014-05-10T00:00:00Z","timestamp":1399680000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2015,3]]},"DOI":"10.1007\/s12532-014-0073-z","type":"journal-article","created":{"date-parts":[[2014,5,9]],"date-time":"2014-05-09T20:55:46Z","timestamp":1399668946000},"page":"1-37","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":39,"title":["Global optimization of nonconvex problems with multilinear intermediates"],"prefix":"10.1007","volume":"7","author":[{"given":"Xiaowei","family":"Bao","sequence":"first","affiliation":[]},{"given":"Aida","family":"Khajavirad","sequence":"additional","affiliation":[]},{"given":"Nikolaos V.","family":"Sahinidis","sequence":"additional","affiliation":[]},{"given":"Mohit","family":"Tawarmalani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,5,10]]},"reference":[{"key":"73_CR1","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1287\/moor.8.2.273","volume":"8","author":"FA Al-Khayyal","year":"1983","unstructured":"Al-Khayyal, F.A., Falk, J.E.: Jointly constrained biconvex programming. Math. Oper. Res. 8, 273\u2013286 (1983)","journal-title":"Math. Oper. Res."},{"key":"73_CR2","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1080\/10556780902883184","volume":"24","author":"X Bao","year":"2009","unstructured":"Bao, X., Sahinidis, N.V., Tawarmalani, M.: Multiterm polyhedral relaxations for nonconvex, quadratically-constrained quadratic programs. Optim. Methods Softw. 24, 485\u2013504 (2009)","journal-title":"Optim. Methods Softw."},{"key":"73_CR3","unstructured":"Belotti, P.: COUENNE: A User\u2019s Manual. Lehigh University, Technical report (2009)"},{"key":"73_CR4","volume-title":"Introduction to Linear Optimization","author":"D Bertsimas","year":"1997","unstructured":"Bertsimas, D., Tsitsiklis, J.N.: Introduction to Linear Optimization. Athena Scientific, UK (1997)"},{"key":"73_CR5","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1007\/s10898-009-9484-1","volume":"47","author":"S Cafieri","year":"2010","unstructured":"Cafieri, S., Lee, J., Liberti, L.: On convex relaxations of quadrilinear terms. J. Glob. Optim. 47, 661\u2013685 (2010)","journal-title":"J. Glob. Optim."},{"key":"73_CR6","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF01587085","volume":"44","author":"Y Crama","year":"1989","unstructured":"Crama, Y.: Recognition problems in polynomials in $$0{-}1$$ 0 - 1 programming. Math. Program. 44, 139\u2013155 (1989)","journal-title":"Math. Program."},{"key":"73_CR7","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF01582138","volume":"61","author":"Y Crama","year":"1993","unstructured":"Crama, Y.: Concave extensions for nonlinear $$0{-}1$$ 0 - 1 maximization problems. Math. Program. 61, 53\u201360 (1993)","journal-title":"Math. Program."},{"key":"73_CR8","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"E Dolan","year":"2002","unstructured":"Dolan, E., More, J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"73_CR9","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1287\/mnsc.15.9.550","volume":"15","author":"JE Falk","year":"1969","unstructured":"Falk, J.E., Soland, R.M.: An algorithm for separable nonconvex programming problems. Manag. Sci. 15, 550\u2013569 (1969)","journal-title":"Manag. Sci."},{"key":"73_CR10","doi-asserted-by":"crossref","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete problems. In: Proceedings of the Sixth Annual ACM Symposium on Theory of Computing, pp. 47\u201363. ACM, New York (1974)","DOI":"10.1145\/800119.803884"},{"key":"73_CR11","unstructured":"Gill, P.E., Murray, W., Saunders, M.A.: User\u2019s Guide for SNOPT 7.2.4: A FORTRAN Package for Large-Scale Nonlinear Programming. Technical report, University of California, San Diego and Stanford University, CA (2008)"},{"key":"73_CR12","unstructured":"Gray, F.: Pulse code communication. U.S. Patent No. 2,632,058 (1953)"},{"key":"73_CR13","doi-asserted-by":"crossref","unstructured":"Hendrickson, B., Leland, R.: A multilevel algorithm for partitioning graphs. In: Proceedings of the 1995 ACM\/IEEE Conference on Supercomputing, p. 28. ACM, New York (1995)","DOI":"10.1145\/224170.224228"},{"key":"73_CR14","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1145\/362248.362272","volume":"16","author":"J Hopcroft","year":"1973","unstructured":"Hopcroft, J., Tarjan, R.: Efficient algorithms for graph manipulation. Commun. ACM 16, 372\u2013378 (1973)","journal-title":"Commun. ACM"},{"key":"73_CR15","unstructured":"IBM. CPLEX Optimizer (2011). http:\/\/www-01.ibm.com\/software\/integration\/optimization\/cplex-optimizer\/"},{"key":"73_CR16","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G Karypis","year":"1999","unstructured":"Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20, 359\u2013392 (1999)","journal-title":"SIAM J. Sci. Comput."},{"key":"73_CR17","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"BW Kernighan","year":"1970","unstructured":"Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49, 291\u2013307 (1970)","journal-title":"Bell Syst. Tech. J."},{"key":"73_CR18","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1080\/10556780902753221","volume":"24","author":"Y Lin","year":"2009","unstructured":"Lin, Y., Schrage, L.: The global solver in the LINDO API. Optim. Methods Softw. 24, 657\u2013668 (2009)","journal-title":"Optim. Methods Softw."},{"key":"73_CR19","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/s10107-012-0606-z","volume":"136","author":"J Luedtke","year":"2012","unstructured":"Luedtke, J., Namazifar, M., Linderoth, J.T.: Some results on the strength of relaxations of multilinear functions. Math. Program. 136, 325\u2013351 (2012)","journal-title":"Math. Program."},{"key":"73_CR20","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF01580665","volume":"10","author":"GP McCormick","year":"1976","unstructured":"McCormick, G.P.: Computability of global solutions to factorable nonconvex programs: part I\u2014convex underestimating problems. Math. Program. 10, 147\u2013175 (1976)","journal-title":"Math. Program."},{"key":"73_CR21","first-page":"327","volume-title":"Frontiers in Global Optimization","author":"CA Meyer","year":"2003","unstructured":"Meyer, C.A., Floudas, C.A.: Trilinear monomials with positive or negative domains: facets of the convex and concave envelopes. In: Floudas, C.A., Pardolos, P.M. (eds.) Frontiers in Global Optimization, vol. 103, pp. 327\u2013352. Kluwer Academic Publishers, Dordrecht (2003)"},{"key":"73_CR22","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1023\/B:JOGO.0000042112.72379.e6","volume":"29","author":"CA Meyer","year":"2004","unstructured":"Meyer, C.A., Floudas, C.A.: Trilinear monomials with mixed sign domains: facets of the convex and concave envelopes. J. Glob. Optim. 29, 125\u2013155 (2004)","journal-title":"J. Glob. Optim."},{"key":"73_CR23","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/s10107-005-0580-9","volume":"103","author":"CA Meyer","year":"2005","unstructured":"Meyer, C.A., Floudas, C.A.: Convex envelopes for edge-concave functions. Math. Program. 103, 207\u2013224 (2005)","journal-title":"Math. Program."},{"key":"73_CR24","unstructured":"Murtagh, B.A., Saunders, M.A.: MINOS 5.5 User\u2019s Guide. Technical Report SOL 83\u201320R, Systems Optimization Laboratory, Department of Operations Research, Stanford University, CA (1995)"},{"key":"73_CR25","unstructured":"Namazifar, M.: Strong Relaxations and Computations for Multilinear Programming. PhD thesis, Department of Industrial and Systems Engineering, University of Wisconsin\u2013Madison (2011)"},{"key":"73_CR26","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1023\/A:1008217604285","volume":"10","author":"AD Rikun","year":"1997","unstructured":"Rikun, A.D.: A convex envelope formula for multilinear functions. J. Glob. Optim. 10, 425\u2013437 (1997)","journal-title":"J. Glob. Optim."},{"key":"73_CR27","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1023\/A:1011295715398","volume":"19","author":"HS Ryoo","year":"2001","unstructured":"Ryoo, H.S., Sahinidis, N.V.: Analysis of bounds for multilinear functions. J. Glob. Optim. 19, 403\u2013424 (2001)","journal-title":"J. Glob. Optim."},{"key":"73_CR28","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF00138693","volume":"8","author":"NV Sahinidis","year":"1996","unstructured":"Sahinidis, N.V.: BARON: a general purpose global optimization software package. J. Glob. Optim. 8, 201\u2013205 (1996)","journal-title":"J. Glob. Optim."},{"key":"73_CR29","unstructured":"Sahinidis, N.V., Tawarmalani, M.: BARON 10.3: Global Optimization of Mixed-Integer Nonlinear Programs, User\u2019s Manual (2012)"},{"key":"73_CR30","unstructured":"Saunders, M.A.: LUMOD: Fortran software for updating dense LU factors. http:\/\/www.stanford.edu\/group\/SOL\/software\/lumod.html"},{"key":"73_CR31","first-page":"253","volume":"7","author":"HD Sherali","year":"1987","unstructured":"Sherali, H.D.: A constructive proof of the representation theorem for polyhedral set based on fundamental definitions. Am. J. Math. Manag. Sci. 7, 253\u2013270 (1987)","journal-title":"Am. J. Math. Manag. Sci."},{"key":"73_CR32","first-page":"245","volume":"22","author":"HD Sherali","year":"1997","unstructured":"Sherali, H.D.: Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets. Acta Math. Vietnam. 22, 245\u2013270 (1997)","journal-title":"Acta Math. Vietnam."},{"key":"73_CR33","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/s11590-007-0065-2","volume":"2","author":"F Tardella","year":"2008","unstructured":"Tardella, F.: Existence and sum decomposition of vertex polyhedral convex envelopes. Optim. Lett. 2, 363\u2013375 (2008)","journal-title":"Optim. Lett."},{"key":"73_CR34","unstructured":"Tawarmalani, M.: Inclusion certificates and simultaneous convexification of functions (2010). http:\/\/www.optimization-online.org\/DB_HTML\/2010\/09\/2722.html"},{"key":"73_CR35","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/s10107-010-0374-6","volume":"124","author":"M Tawarmalani","year":"2010","unstructured":"Tawarmalani, M., Richard, J.-P., Chung, K.: Strong valid inequalities for orthogonal disjunctions and bilinear covering sets. Math. Program. 124, 481\u2013512 (2010)","journal-title":"Math. Program."},{"key":"73_CR36","author":"M Tawarmalani","year":"2012","unstructured":"Tawarmalani, M., Richard, J.-P., Xiong, C.: Explicit convex and concave envelopes through polyhedral subdivisions. Math. Program. (2012). doi: 10.1007\/s10107-012-0581-4","journal-title":"Math. Program."},{"key":"73_CR37","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3532-1","volume-title":"Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications","author":"M Tawarmalani","year":"2002","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications. Kluwer Academic Publishers, Dordrecht (2002)"},{"key":"73_CR38","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1007\/s10107-003-0467-6","volume":"99","author":"M Tawarmalani","year":"2004","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study. Math. Program. 99, 563\u2013591 (2004)","journal-title":"Math. Program."},{"key":"73_CR39","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10107-005-0581-8","volume":"103","author":"M Tawarmalani","year":"2005","unstructured":"Tawarmalani, M., Sahinidis, N.V.: A polyhedral branch-and-cut approach to global optimization. Math. Program. 103, 225\u2013249 (2005)","journal-title":"Math. Program."},{"key":"73_CR40","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A W\u00e4chter","year":"2006","unstructured":"W\u00e4chter, A., Biegler, L.T.: On the implementation of a primal-dual interior point filter line search algorithm for large-scale nonlinear programming. Math. Program. 106, 25\u201357 (2006)","journal-title":"Math. Program."}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-014-0073-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-014-0073-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-014-0073-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T12:15:58Z","timestamp":1559477758000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-014-0073-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,10]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,3]]}},"alternative-id":["73"],"URL":"https:\/\/doi.org\/10.1007\/s12532-014-0073-z","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5,10]]}}}