{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T20:40:04Z","timestamp":1774557604761,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2015,6,25]],"date-time":"2015-06-25T00:00:00Z","timestamp":1435190400000},"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. Program."],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1007\/s10107-015-0921-2","type":"journal-article","created":{"date-parts":[[2015,6,24]],"date-time":"2015-06-24T01:51:19Z","timestamp":1435110679000},"page":"235-266","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":26,"title":["Exact quadratic convex reformulations of mixed-integer quadratically constrained problems"],"prefix":"10.1007","volume":"158","author":[{"given":"Alain","family":"Billionnet","sequence":"first","affiliation":[]},{"given":"Sourour","family":"Elloumi","sequence":"additional","affiliation":[]},{"given":"Am\u00e9lie","family":"Lambert","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,25]]},"reference":[{"key":"921_CR1","first-page":"2849","volume-title":"Handbook of Combinatorial Optimization","author":"WP Adams","year":"2013","unstructured":"Adams, W.P., Sherali, H.D.: Reformulation linearization technique for discrete optimization problems. In: Pardalos, Panos M., Du, Ding-Zhu, Graham, Ronald L. (eds.) Handbook of Combinatorial Optimization, pp. 2849\u20132896. Springer, New York (2013)"},{"key":"921_CR2","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF01099462","volume":"6","author":"FA Al-Khayyal","year":"1995","unstructured":"Al-Khayyal, F.A., Larsen, C., Van Voorhis, T.: A relaxation method for nonconvex quadratically constrained programs. J. Glob. Optim. 6, 215\u2013230 (1995)","journal-title":"J. Glob. Optim."},{"key":"921_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-1-4614-0769-0_1","volume":"166","author":"MF Anjos","year":"2012","unstructured":"Anjos, M.F., Lasserre, J.B.: Handbook of semidefinite, conic and polynomial optimization: theory, algorithms, software and applications. Int. Ser. Oper. Res. Manag. Sci. 166, 1\u201322 (2012)","journal-title":"Int. Ser. Oper. Res. Manag. Sci."},{"issue":"1","key":"921_CR4","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/s101079900106","volume":"87","author":"C Audet","year":"2000","unstructured":"Audet, C., Hansen, P., Jaumard, B., Savard, G.: A branch and cut algorithm for non-convex quadratically constrained quadratic programming. Math. Program. 87(1), 131\u2013152 (2000)","journal-title":"Math. Program."},{"key":"921_CR5","series-title":"GERAD 25th anniversary series","doi-asserted-by":"crossref","DOI":"10.1007\/b135610","volume-title":"Essays and Surveys in Global Optimization","author":"C Audet","year":"2005","unstructured":"Audet, C., Hansen, P., Savard, G.: Essays and Surveys in Global Optimization. GERAD 25th anniversary series. Springer, New York (2005)"},{"key":"921_CR6","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s10107-011-0462-2","volume":"129","author":"X Bao","year":"2011","unstructured":"Bao, X., Sahinidis, N.V., Tawarmalani, M.: Semidefinite relaxations for quadratically constrained quadratic programming: a review and comparisons. Math. Program. 129, 129\u2013157 (2011)","journal-title":"Math. Program."},{"key":"921_CR7","doi-asserted-by":"crossref","unstructured":"Billionnet, A., Elloumi, S., Lambert, A.: Linear reformulations of integer quadratic programs. In: MCO 2008, September 8\u201310, pp. 43\u201351 (2008)","DOI":"10.1007\/978-3-540-87477-5_5"},{"issue":"1","key":"921_CR8","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/s10107-010-0381-7","volume":"131","author":"A Billionnet","year":"2012","unstructured":"Billionnet, A., Elloumi, S., Lambert, A.: Extending the QCR method to the case of general mixed integer program. Math. Program. 131(1), 381\u2013401 (2012)","journal-title":"Math. Program."},{"issue":"1","key":"921_CR9","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1080\/10556789908805765","volume":"11","author":"B Borchers","year":"1999","unstructured":"Borchers, B.: Csdp, a c library for semidefinite programming. Optim. Methods Softw. 11(1), 613\u2013623 (1999)","journal-title":"Optim. Methods Softw."},{"issue":"1\u20132","key":"921_CR10","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1007\/s10107-012-0534-y","volume":"141","author":"C Buchheim","year":"2013","unstructured":"Buchheim, C., Wiegele, A.: Semidefinite relaxations for non-convex quadratic mixed-integer programming. Math. Program. 141(1\u20132), 435\u2013452 (2013)","journal-title":"Math. Program."},{"issue":"2","key":"921_CR11","first-page":"97","volume":"17","author":"S Burer","year":"2012","unstructured":"Burer, S., Letchford, A.: Non-convex mixed-integer nonlinear programming: a survey. Surv. Oper. Res. Manag. Sci. 17(2), 97\u2013106 (2012)","journal-title":"Surv. Oper. Res. Manag. Sci."},{"key":"921_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4949-6","volume-title":"Deterministic Global Optimization","author":"CA Floudas","year":"2000","unstructured":"Floudas, C.A.: Deterministic Global Optimization. Kluwer Academic Publishing, Dordrecht (2000)"},{"key":"921_CR13","volume-title":"Computers and Intractability: A guide to the Theory of NP-Completness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A guide to the Theory of NP-Completness. W.H. Freeman, San Francisco (1979)"},{"key":"921_CR14","unstructured":"IBM-ILOG. Ibm ilog cplex 12.5 reference manual. http:\/\/pic.dhe.ibm.com\/infocenter\/cosinfoc\/v12r2\/index.jsp (2013)"},{"key":"921_CR15","unstructured":"Lambert, A.: IQCP\/MIQCP: Library of integer and mixed-integer quadratic quadratically constrained programs. http:\/\/cedric.cnam.fr\/~lambe_a1\/smiqp\/Library\/iqcp_miqcp.html (2013)"},{"key":"921_CR16","series-title":"Chapter: Nonconvex optimization and its applications","doi-asserted-by":"crossref","DOI":"10.1007\/0-387-30528-9","volume-title":"Global optimization: From Theory to Tmplementation","author":"L Liberti","year":"2006","unstructured":"Liberti, L., Maculan, N.: Global optimization: From Theory to Tmplementation. Chapter: Nonconvex optimization and its applications. Springer, New York (2006)"},{"key":"921_CR17","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."},{"issue":"1","key":"921_CR18","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 non-convex programs: Part i: convex underestimating problems. Math. Program. 10(1), 147\u2013175 (1976)","journal-title":"Math. Program."},{"key":"921_CR19","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/s10107-012-0555-6","volume":"136","author":"R Misener","year":"2012","unstructured":"Misener, R., Floudas, C.A.: Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations. Math. Program. 136, 155\u2013182 (2012)","journal-title":"Math. Program."},{"issue":"1","key":"921_CR20","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10898-012-9874-7","volume":"57","author":"R Misener","year":"2013","unstructured":"Misener, R., Floudas, C.A.: GloMIQO: global mixed-integer quadratic optimizer. J. Glob. Optim. 57(1), 3\u201350 (2013)","journal-title":"J. Glob. Optim."},{"key":"921_CR21","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1023\/A:1008377529330","volume":"13","author":"U Raber","year":"1998","unstructured":"Raber, U.: A simplicial branch-and-bound method for solving nonconvex all-quadratic programs. J. Glob. Optim. 13, 417\u2013432 (1998)","journal-title":"J. Glob. Optim."},{"key":"921_CR22","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/s10107-010-0340-3","volume":"130","author":"A Saxena","year":"2011","unstructured":"Saxena, A., Bonami, P., Lee, J.: Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations. Math. Program. 130, 359\u2013413 (2011)","journal-title":"Math. Program."},{"key":"921_CR23","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","author":"M Tawarmalani","year":"2002","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Convexification and Global Optimization in Continuous and Mixed-integer Nonlinear Programming. Kluwer Academic Publishing, Dordrecht (2002)"},{"issue":"2","key":"921_CR24","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(2), 225\u2013249 (2005)","journal-title":"Math. Program."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0921-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-015-0921-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0921-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T06:00:08Z","timestamp":1559109608000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-015-0921-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,25]]},"references-count":24,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["921"],"URL":"https:\/\/doi.org\/10.1007\/s10107-015-0921-2","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6,25]]}}}