{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T20:15:11Z","timestamp":1780344911536,"version":"3.54.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2010,5,11]],"date-time":"2010-05-11T00:00:00Z","timestamp":1273536000000},"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":[[2010,7]]},"DOI":"10.1007\/s10107-010-0355-9","type":"journal-article","created":{"date-parts":[[2010,5,10]],"date-time":"2010-05-10T12:50:35Z","timestamp":1273495835000},"page":"33-43","source":"Crossref","is-referenced-by-count":73,"title":["Computable representations for convex hulls of low-dimensional quadratic forms"],"prefix":"10.1007","volume":"124","author":[{"given":"Kurt M.","family":"Anstreicher","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Samuel","family":"Burer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2010,5,11]]},"reference":[{"key":"355_CR1","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/s10898-008-9372-0","volume":"43","author":"K. Anstreicher","year":"2009","unstructured":"Anstreicher K.: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming. J. Glob. Optim. 43, 471\u2013484 (2009)","journal-title":"J. Glob. Optim."},{"key":"355_CR2","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1023\/A:1013886408463","volume":"22","author":"I. Bomze","year":"2002","unstructured":"Bomze I.: Branch-and-bound approaches to standard quadratic optimization problems. J. Glob. Optim. 22, 27\u201337 (2002)","journal-title":"J. Glob. Optim."},{"key":"355_CR3","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1023\/A:1026583532263","volume":"18","author":"I. Bomze","year":"2000","unstructured":"Bomze I., D\u00fcr M., de Klerk 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":"355_CR4","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1023\/A:1020209017701","volume":"24","author":"I. Bomze","year":"2002","unstructured":"Bomze I., de Klerk E.: Solving standard quadratic optimization problems via linear, semidefinite, and copositive programming. J. Glob. Optim. 24, 163\u2013185 (2002)","journal-title":"J. Glob. Optim."},{"key":"355_CR5","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/s10107-008-0223-z","volume":"120","author":"S. Burer","year":"2009","unstructured":"Burer S.: On the copositive representation of binary and continuous nonconvex quadratic programs. Math. Prog. 120, 479\u2013495 (2009)","journal-title":"Math. Prog."},{"key":"355_CR6","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 \u2212 1)-convex functions. SIAM. J. Optim. 19, 1451\u20131466 (2008)","journal-title":"SIAM. J. Optim."},{"key":"355_CR7","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0012-365X(93)90374-3","volume":"114","author":"N. Kogan","year":"1993","unstructured":"Kogan N., Berman A.: Characterization of completely positive graphs. Discrete Math. 114, 297\u2013304 (1993)","journal-title":"Discrete Math."},{"key":"355_CR8","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. Prog. 103, 251\u2013282 (2005)","journal-title":"Math. Prog."},{"key":"355_CR9","doi-asserted-by":"crossref","first-page":"533","DOI":"10.4153\/CJM-1965-053-6","volume":"17","author":"T. Motzkin","year":"1965","unstructured":"Motzkin T., Straus E.: Maxima for graphs and a new proof of a theorem of T\u00faran. Can. J. Math. 17, 533\u2013540 (1965)","journal-title":"Can. J. Math."},{"key":"355_CR10","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1287\/moor.23.2.339","volume":"23","author":"G. Pataki","year":"1998","unstructured":"Pataki G.: On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues. Math. Oper. Res. 23, 339\u2013358 (1998)","journal-title":"Math. Oper. Res."},{"key":"355_CR11","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF00138693","volume":"8","author":"N. Sahinidis","year":"1996","unstructured":"Sahinidis N.: BARON: a general purpose global optimization software package. J. Glob. Optim. 8, 201\u2013205 (1996)","journal-title":"J. Glob. Optim."},{"key":"355_CR12","volume-title":"A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems","author":"H. Sherali","year":"1998","unstructured":"Sherali H., Adams W.: A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems. Kluwer, Dordrecht (1998)"},{"key":"355_CR13","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/BF00122429","volume":"2","author":"H. Sherali","year":"1992","unstructured":"Sherali H., Alameddine A.: A new reformulation-linearization technique for bilinear programming problems. J. Glob. Optim. 2, 379\u2013410 (1992)","journal-title":"J. Glob. Optim."},{"key":"355_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01100203","volume":"7","author":"H. Sherali","year":"1995","unstructured":"Sherali H., Tuncbilek C.: A reformulation-convexification approach for solving nonconvex quadratic programming problems. J. Glob. Optim. 7, 1\u201331 (1995)","journal-title":"J. Glob. Optim."},{"key":"355_CR15","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1007\/s10107-004-0550-7","volume":"102","author":"D. Vandenbussche","year":"2005","unstructured":"Vandenbussche D., Nemhauser G.: A branch-and-cut algorithm for nonconvex quadratic programming with box constraints. Math. Prog. 102, 559\u2013575 (2005)","journal-title":"Math. Prog."},{"key":"355_CR16","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/s10107980012a","volume":"84","author":"Y. Ye","year":"1999","unstructured":"Ye Y.: Approximating quadratic programming with bound and quadratic constraints. Math. Prog. 84, 219\u2013226 (1999)","journal-title":"Math. Prog."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-010-0355-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-010-0355-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-010-0355-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:50:07Z","timestamp":1559123407000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-010-0355-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,11]]},"references-count":16,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2010,7]]}},"alternative-id":["355"],"URL":"https:\/\/doi.org\/10.1007\/s10107-010-0355-9","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5,11]]}}}