{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:27:38Z","timestamp":1775003258982,"version":"3.50.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2012,12,2]],"date-time":"2012-12-02T00:00:00Z","timestamp":1354406400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1007\/s10107-012-0616-x","type":"journal-article","created":{"date-parts":[[2012,12,1]],"date-time":"2012-12-01T03:37:02Z","timestamp":1354333022000},"page":"65-91","source":"Crossref","is-referenced-by-count":27,"title":["On convex envelopes for bivariate functions over polytopes"],"prefix":"10.1007","volume":"144","author":[{"given":"Marco","family":"Locatelli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabio","family":"Schoen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,12,2]]},"reference":[{"key":"616_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":"616_CR2","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10107-010-0355-9","volume":"124","author":"KM Anstreicher","year":"2010","unstructured":"Anstreicher, K.M., Burer, S.: Computable representations for convex hulls of low-dimensional quadratic forms. Math. Program. B 124, 33\u201343 (2010)","journal-title":"Math. Program. B"},{"key":"616_CR3","unstructured":"Anstreicher, K.M.: On convex relaxations for quadratically constrained quadratic programming. Math. Program. B. Available at http:\/\/www.optimization-online.org\/DB_HTML\/2010\/08\/2699.html (2011, to appear)"},{"key":"616_CR4","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":"616_CR5","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/B:COAP.0000004976.52180.7f","volume":"27","author":"HP Benson","year":"2004","unstructured":"Benson, H.P.: On the construction of convex and concave envelope formulas for bilinear and fractional functions on quadrilaterals. Comput. Optim. Appl. 27, 5\u201322 (2004)","journal-title":"Comput. Optim. Appl."},{"key":"616_CR6","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1023\/A:1026583532263","volume":"18","author":"IM Bomze","year":"2000","unstructured":"Bomze, I.M., Duer, M., DeKlerk, E., Roos, C., Quist, A., Terlaky, T.: On copositive programming and standard quadratic optimization problems. J. Glob. Optim. 18, 301\u2013320 (2000)","journal-title":"J. Glob. Optim."},{"key":"616_CR7","doi-asserted-by":"crossref","first-page":"218","DOI":"10.2307\/2311058","volume":"69","author":"L Brickman","year":"1962","unstructured":"Brickman, L., Steinberg, L.: On nonnegative polynomials. Am. Math. Mon. 69, 218\u2013221 (1962)","journal-title":"Am. Math. Mon."},{"key":"616_CR8","first-page":"103","volume":"58","author":"M-D Choi","year":"1995","unstructured":"Choi, M.-D., Lam, T.-Y., Reznick, B.: Sums of squares of real polynomials. Proc. Symp. Pure Math. 58, 103\u2013126 (1995)","journal-title":"Proc. Symp. Pure Math."},{"key":"616_CR9","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF01587085","volume":"44","author":"Y Crama","year":"1989","unstructured":"Crama, Y.: Recognition problems for polynomials in 0\u20131 variables. Math. Program. 44, 139\u2013155 (1989)","journal-title":"Math. Program."},{"key":"616_CR10","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\u20131 maximization problems. Math. Program. 61, 53\u201360 (1993)","journal-title":"Math. Program."},{"key":"616_CR11","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1017\/S0305004100036185","volume":"58","author":"PH Diananda","year":"1967","unstructured":"Diananda, P.H.: On non-negative forms in real variables some or all of which are non-negative. Proc. Camb. Philos. Soc. 58, 17\u201325 (1967)","journal-title":"Proc. Camb. Philos. Soc."},{"key":"616_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03199-5","volume-title":"Global Optimization: Deterministic Approaches","author":"R Horst","year":"1996","unstructured":"Horst, R., Tuy, H.: Global Optimization: Deterministic Approaches, 3rd edn. Springer, Berlin (1996)","edition":"3"},{"key":"616_CR13","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1023\/A:1013807129844","volume":"22","author":"T Kuno","year":"2002","unstructured":"Kuno, T.: A branch-and-bound algorithm for maximizing the sum of several linear ratios. J. Glob. Optim. 22, 155\u2013174 (2002)","journal-title":"J. Glob. Optim."},{"issue":"3","key":"616_CR14","doi-asserted-by":"crossref","first-page":"1451","DOI":"10.1137\/07069359X","volume":"19","author":"M Jach","year":"2008","unstructured":"Jach, M., Michaels, D., Weismantel, R.: The convex envelope of ( $$n$$ -1)-convex functions. SIAM J. Optim. 19(3), 1451\u20131466 (2008)","journal-title":"SIAM J. Optim."},{"key":"616_CR15","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/s10107-005-0589-0","volume":"106","author":"D Jibetean","year":"2006","unstructured":"Jibetean, D., de Klerk, E.: Global optimization of rational functions: a semidefinite programming approach. Math. Program. 106, 93\u2013109 (2006)","journal-title":"Math. Program."},{"key":"616_CR16","doi-asserted-by":"crossref","unstructured":"Khajavirad, A., Sahinidis, N.V.: Convex envelopes of products of convex and component-wise concave functions. J. Glob. Optim. Online first version available (2011, to appear)","DOI":"10.1007\/s10898-011-9747-5"},{"key":"616_CR17","first-page":"635","volume":"15","author":"R Laraki","year":"2008","unstructured":"Laraki, R., Lasserre, J.B.: Computing uniform convex approximations for convex envelopes and convex hulls. J. Convex Anal. 15, 635\u2013654 (2008)","journal-title":"J. Convex Anal."},{"issue":"2","key":"616_CR18","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1023\/A:1021924706467","volume":"25","author":"L Liberti","year":"2003","unstructured":"Liberti, L., Pantelides, C.C.: Convex envelopes of monomials of odd degree. J. Glob. Optim. 25(2), 157\u2013168 (2003)","journal-title":"J. Glob. Optim."},{"key":"616_CR19","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/s10107-005-0582-7","volume":"103","author":"J Linderoth","year":"2005","unstructured":"Linderoth, J.: A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs. Math. Program. 103, 251\u2013282 (2005)","journal-title":"Math. Program."},{"key":"616_CR20","unstructured":"Locatelli, M., Schoen, F.: On convex envelopes and underestimators for bivariate functions. Available at http:\/\/www.optimization-online.org\/DB_FILE\/2009\/11\/2462.pdf (2009)"},{"key":"616_CR21","unstructured":"Luedtke, J., Namazifar, M., Linderoth, J.T.: Some results on the strength of relaxations of multilinear functions. Technical report 1678. Computer Sciences Department, University of Wisconsin-Madison (2010)"},{"key":"616_CR22","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\u2014part I\u2014convex underestimating problems. Math. Program. 10, 147\u2013175 (1976)","journal-title":"Math. Program."},{"key":"616_CR23","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.: Convex hull of trilinear monomials with mixed sign domains. J. Glob. Optim. 29, 125\u2013155 (2004)","journal-title":"J. Glob. Optim."},{"key":"616_CR24","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":"616_CR25","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1007\/s10898-006-9119-8","volume":"40","author":"J Nie","year":"2008","unstructured":"Nie, J., Demmel, J., Gu, M.: Global minimization of rational functions and the nearest GCDs. J. Glob. Optim. 40, 697\u2013718 (2008)","journal-title":"J. Glob. Optim."},{"key":"616_CR26","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1023\/A:1008217604285","volume":"10","author":"A Rikun","year":"1997","unstructured":"Rikun, A.: A convex envelope formula for multilinear functions. J. Glob. Optim. 10, 425\u2013437 (1997)","journal-title":"J. Glob. Optim."},{"key":"616_CR27","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton, NJ (1970)"},{"key":"616_CR28","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":"616_CR29","first-page":"197","volume":"27","author":"HD Sherali","year":"1992","unstructured":"Sherali, H.D., Alameddine, A.: An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes. Ann. Oper. Res. 27, 197\u2013210 (1992)","journal-title":"Ann. Oper. Res."},{"key":"616_CR30","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 Mathematica Vietnamica 22, 245\u2013270 (1997)","journal-title":"Acta Mathematica Vietnamica"},{"key":"616_CR31","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1023\/A:1011233805045","volume":"20","author":"M Tawarmalani","year":"2001","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Semidefinite relaxations of fractional programs via novel convexification techniques. J. Glob. Optim. 20, 137\u2013158 (2001)","journal-title":"J. Glob. Optim."},{"key":"616_CR32","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":"616_CR33","first-page":"563","volume-title":"Frontiers in Global Optimization","author":"F Tardella","year":"2003","unstructured":"Tardella, F.: On the existence of polyhedral convex envelopes. In: Floudas, C.A., Pardalos, P.M. (eds.) Frontiers in Global Optimization, pp. 563\u2013574. Kluwer, Dordrecht (2003)"},{"key":"616_CR34","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":"616_CR35","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1023\/A:1008312714792","volume":"14","author":"JM Zamora","year":"1999","unstructured":"Zamora, J.M., Grossmann, I.E.: A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms. J. Glob. Optim. 14, 217\u2013249 (1999)","journal-title":"J. Glob. Optim."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0616-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-012-0616-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0616-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,6]],"date-time":"2019-07-06T08:58:05Z","timestamp":1562403485000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-012-0616-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12,2]]},"references-count":35,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["616"],"URL":"https:\/\/doi.org\/10.1007\/s10107-012-0616-x","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,12,2]]}}}