{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T13:16:57Z","timestamp":1779887817497,"version":"3.53.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2010,5,12]],"date-time":"2010-05-12T00:00:00Z","timestamp":1273622400000},"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-0371-9","type":"journal-article","created":{"date-parts":[[2010,5,11]],"date-time":"2010-05-11T10:41:49Z","timestamp":1273574509000},"page":"383-411","source":"Crossref","is-referenced-by-count":65,"title":["Convex relaxations of non-convex mixed integer quadratically constrained programs: extended formulations"],"prefix":"10.1007","volume":"124","author":[{"given":"Anureet","family":"Saxena","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pierre","family":"Bonami","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jon","family":"Lee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2010,5,12]]},"reference":[{"key":"371_CR1","doi-asserted-by":"crossref","unstructured":"Anstreicher, K.M.: Semidefinite Programming versus the Reformulation-Linearization Technique for Nonconvex Quadratically Constrained Quadratic Programming. Pre-print, Optimization Online, May 2007","DOI":"10.1007\/s10898-008-9372-0"},{"issue":"1\u20133","key":"371_CR2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0166-218X(98)00136-X","volume":"89","author":"E. Balas","year":"1998","unstructured":"Balas E.: Disjunctive programming: properties of the convex hull of feasible points. Discrete Appl. Math. 89(1\u20133), 3\u201344 (1998)","journal-title":"Discrete Appl. Math."},{"issue":"1\u20133","key":"371_CR3","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"E. Balas","year":"1993","unstructured":"Balas E., Ceria S., Cornu\u00e9jols G.: A lift-and-project cutting plane algorithm for mixed 0\u20131 programs. Math. Program. 58(1\u20133), 295\u2013324 (1993)","journal-title":"Math. Program."},{"key":"371_CR4","doi-asserted-by":"crossref","unstructured":"Balas, E.: Projection and lifting in combinatorial optimization. In: Juenger, M., Naddef, D. (eds.) Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions, Lecture Notes in Computer Science, vol. 2241, pp. 26\u201356. Springer (2001)","DOI":"10.1007\/3-540-45586-8_2"},{"issue":"2","key":"371_CR5","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/s10107-006-0049-5","volume":"113","author":"E. Balas","year":"2008","unstructured":"Balas E., Saxena A.: Optimizing over the split closure. Math. Program. 113(2), 219\u2013240 (2008)","journal-title":"Math. Program."},{"issue":"1\u20133","key":"371_CR6","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF01587096","volume":"44","author":"E. Balas","year":"1989","unstructured":"Balas E., Tama J., Tind J.: Sequential convexification in reverse convex and disjunctive programming. Math. Program. 44(1\u20133), 337\u2013350 (1989)","journal-title":"Math. Program."},{"key":"371_CR7","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/j.disopt.2006.10.011","volume":"5","author":"P. Bonami","year":"2008","unstructured":"Bonami P., Biegler L.T., Conn A.R., Cornu\u00e9jols G., Grossmann I.E., Laird C.D., Lee J., Lodi A., Margot F., Sawaya N., W\u00e4chter A.: An algorithmic framework for convex mixed-integer nonlinear programs. Discrete Optim. 5, 186\u2013204 (2008)","journal-title":"Discrete Optim."},{"issue":"3","key":"371_CR8","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/s10107-006-0080-6","volume":"113","author":"S. Burer","year":"2008","unstructured":"Burer S., Vandenbussche D.: A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations. Math. Program. 113(3), 259\u2013282 (2008)","journal-title":"Math. Program."},{"issue":"1","key":"371_CR9","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s10479-006-0100-1","volume":"149","author":"G. Cornu\u00e9jols","year":"2007","unstructured":"Cornu\u00e9jols G.: Revival of the Gomory cuts in the 1990\u2019s. Ann. Oper. Res. 149(1), 63\u201366 (2007)","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"371_CR10","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1007\/BF01585184","volume":"62","author":"C. Delorme","year":"1993","unstructured":"Delorme C., Poljak S.: Laplacian eigenvalues and the maximum cut problem. Math. Program. Ser. A 62(3), 557\u2013574 (1993)","journal-title":"Math. Program. Ser. A"},{"issue":"1","key":"371_CR11","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10107-006-0054-8","volume":"110","author":"M. Fischetti","year":"2007","unstructured":"Fischetti M., Lodi A.: Optimizing over the first Chv\u00e1tal closure. Math. Program. 110(1), 3\u201320 (2007)","journal-title":"Math. Program."},{"key":"371_CR12","unstructured":"Fletcher, R., Leyffer, S.: User Manual for FilterSQP. Numerical Analysis Report NA\/181, Dundee University (1998)"},{"key":"371_CR13","unstructured":"GLOBALLib, www.gamsworld.org\/global\/globallib\/globalstat.htm"},{"issue":"6","key":"371_CR14","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M.X. Goemans","year":"1995","unstructured":"Goemans M.X., Williamson D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42(6), 1115\u20131145 (1995)","journal-title":"J. ACM"},{"key":"371_CR15","doi-asserted-by":"crossref","unstructured":"Helmberg, C., Poljak, S., Rendl, F., Wolkowicz, H.: Combining semidefinite and polyhedral relaxations for integer programs. Integer programming and combinatorial optimization (Copenhagen, 1995), Lecture Notes in Comput. Sci., 920, pp. 124\u2013134. Springer, Berlin (1995)","DOI":"10.1007\/3-540-59408-6_46"},{"issue":"1","key":"371_CR16","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1287\/opre.21.1.221","volume":"21","author":"R.G. Jeroslow","year":"1973","unstructured":"Jeroslow R.G.: There cannot be any algorithm for integer programming with quadratic constraints. Oper. Res. 21(1), 221\u2013224 (1973)","journal-title":"Oper. Res."},{"key":"371_CR17","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1080\/10556780108805819","volume":"15","author":"S. Kim","year":"2001","unstructured":"Kim S., Kojima M.: Second order cone programming relaxation of nonconvex quadratic optimization problems. Optim. Methods Softw. 15, 201\u2013204 (2001)","journal-title":"Optim. Methods Softw."},{"key":"371_CR18","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/0024-3795(95)00271-R","volume":"223\/224","author":"M. Laurent","year":"1995","unstructured":"Laurent M., Poljak S.: On a positive semidefinite relaxation of the cut polytope. Special issue honoring Miroslav Fiedler and Vlastimil Ptk. Linear Algebra Appl. 223\/224, 439\u2013461 (1995)","journal-title":"Linear Algebra Appl."},{"issue":"3","key":"371_CR19","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1137\/0617031","volume":"17","author":"M. Laurent","year":"1996","unstructured":"Laurent M., Poljak S.: On the facial structure of the set of correlation matrices. SIAM J. Matrix Anal. Appl. 17(3), 530\u2013547 (1996)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"371_CR20","doi-asserted-by":"crossref","first-page":"1675","DOI":"10.1016\/S0098-1354(01)00732-3","volume":"25","author":"S. Lee","year":"2001","unstructured":"Lee S., Grossmann I.E.: A global optimization algorithm for nonconvex generalized disjunctive programming and applications to process systems. Comput. Chem. Eng. 25, 1675\u20131697 (2001)","journal-title":"Comput. Chem. Eng."},{"key":"371_CR21","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF00121658","volume":"9","author":"T. Matsui","year":"1996","unstructured":"Matsui T.: NP-hardness of linear multiplicative programming and related problems. J. Glob. Optim. 9, 113\u2013119 (1996)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"371_CR22","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF01580665","volume":"10","author":"G.P. McCormick","year":"1976","unstructured":"McCormick G.P.: Computability of global solutions to factorable nonconvex programs: part I Convex underestimating problems. Math. Program. 10(1), 147\u2013175 (1976)","journal-title":"Math. Program."},{"key":"371_CR23","unstructured":"PENNON, http:\/\/www.penopt.com"},{"key":"371_CR24","doi-asserted-by":"crossref","unstructured":"Saxena, A., Bonami, P., Lee, J.: Disjunctive cuts for non-convex mixed integer quadratically constrained problems. In: Lodi, A., Panconesi, A., Rinaldi, G., (eds.) Integer programming and combinatorial optimization (Bertinoro, 2008), Lecture Notes in Computer Science, vol. 5035, pp. 17\u201333. Springer, Heidelberg (2008)","DOI":"10.1007\/978-3-540-68891-4_2"},{"key":"371_CR25","unstructured":"Saxena, A., Bonami, P., Lee, J.: Convex relaxations of mixed integer quadratically constrained programs: extended formulations. IBM Research Report RC24621, 08\/2008. Available on Optimization Online"},{"key":"371_CR26","unstructured":"Saxena, A., Bonami, P., Lee, J.: Convex relaxations of mixed integer quadratically constrained programs: projected formulations. IBM Research Report RC24695, 11\/2008. Available on Optimization Online"},{"key":"371_CR27","unstructured":"Saxena, A., Goyal, V., Lejeune, M.: MIP reformulations of the probabilistic set covering problem. Math. Program. (to appear)"},{"issue":"2","key":"371_CR28","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0167-6377(92)90037-4","volume":"11","author":"S. Sen","year":"1992","unstructured":"Sen S.: Relaxations for probabilistically constrained programs with discrete random variables. Oper. Res. Lett. 11(2), 81\u201386 (1992)","journal-title":"Oper. Res. Lett."},{"key":"371_CR29","volume-title":"A reformulation-linearization technique for solving discrete and continuous nonconvex problems","author":"H.D. Sherali","year":"1998","unstructured":"Sherali H.D., Adams W.P.: A reformulation-linearization technique for solving discrete and continuous nonconvex problems. Kluwer, Boston (1998)"},{"key":"371_CR30","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1023\/A:1013819515732","volume":"22","author":"H.D. Sherali","year":"2002","unstructured":"Sherali H.D., Fraticelli B.M.P.: Enhancing RLT relaxations via a new class of semidefinite cuts. J. Glob. Optim. 22, 233\u2013261 (2002)","journal-title":"J. Glob. Optim."},{"key":"371_CR31","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/s101070050103","volume":"86","author":"R. Stubbs","year":"1999","unstructured":"Stubbs R., Mehrotra S.: A branch-and-cut method for 0\u20131 mixed convex programming. Math. Program. 86, 515\u2013532 (1999)","journal-title":"Math. Program."},{"key":"371_CR32","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11\u201312","author":"J.F. Sturm","year":"1999","unstructured":"Sturm J.F.: Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim. Methods Softw. 11\u201312, 625\u2013653 (1999)","journal-title":"Optim. Methods Softw."},{"key":"371_CR33","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, Boston (2002)"},{"issue":"3","key":"371_CR34","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(3), 563\u2013591 (2004)","journal-title":"Math. Program."},{"issue":"3","key":"371_CR35","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1007\/s10107-004-0549-0","volume":"102","author":"D. Vandenbussche","year":"2005","unstructured":"Vandenbussche D., Nemhauser G.L.: A polyhedral study of nonconvex quadratic programs with box constraints. Math. Program. 102(3), 531\u2013557 (2005)","journal-title":"Math. Program."},{"issue":"3","key":"371_CR36","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.L.: A branch-and-cut algorithm for nonconvex quadratic programs with box constraints. Math. Program. 102(3), 559\u2013575 (2005)","journal-title":"Math. Program."},{"issue":"1","key":"371_CR37","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(1), 25\u201357 (2006)","journal-title":"Math. Program."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-010-0371-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-010-0371-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-0371-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:50:08Z","timestamp":1559123408000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-010-0371-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,12]]},"references-count":37,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2010,7]]}},"alternative-id":["371"],"URL":"https:\/\/doi.org\/10.1007\/s10107-010-0371-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,12]]}}}