{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T08:54:38Z","timestamp":1772614478716,"version":"3.50.1"},"reference-count":77,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2015,2,17]],"date-time":"2015-02-17T00:00:00Z","timestamp":1424131200000},"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,1]]},"DOI":"10.1007\/s10107-015-0866-5","type":"journal-article","created":{"date-parts":[[2015,2,17]],"date-time":"2015-02-17T05:43:08Z","timestamp":1424151788000},"page":"575-611","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":31,"title":["Intersection cuts for nonlinear integer programming: convexification techniques for structured sets"],"prefix":"10.1007","volume":"155","author":[{"given":"Sina","family":"Modaresi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mustafa R.","family":"K\u0131l\u0131n\u00e7","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan Pablo","family":"Vielma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,2,17]]},"reference":[{"key":"866_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s12532-008-0001-1","volume":"1","author":"T Achterberg","year":"2009","unstructured":"Achterberg, T.: SCIP: solving constraint integer programs. Math. Program. Comput. 1, 1\u201341 (2009)","journal-title":"Math. Program. Comput."},{"key":"866_CR2","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/s10107-004-0558-z","volume":"102","author":"K Andersen","year":"2005","unstructured":"Andersen, K., Cornu\u00e9jols, G., Li, Y.: Split closure and intersection cuts. Math. Program. 102, 457\u2013493 (2005)","journal-title":"Math. Program."},{"key":"866_CR3","doi-asserted-by":"crossref","unstructured":"Andersen, K., Jensen, A.: Intersection cuts for mixed integer conic quadratic sets. In: Goemans, M., Correa, J. (eds.) 16th International IPCO Conference, Valparaiso, Lecture Notes in Computer Science, pp. 37\u201348. Springer (2013)","DOI":"10.1007\/978-3-642-36694-9_4"},{"key":"866_CR4","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/moor.1090.0439","volume":"35","author":"K Andersen","year":"2010","unstructured":"Andersen, K., Louveaux, Q., Weismantel, R.: An analysis of mixed integer linear sets based on lattice point free convex sets. Math. Oper. Res. 35, 233\u2013256 (2010)","journal-title":"Math. Oper. Res."},{"key":"866_CR5","doi-asserted-by":"crossref","unstructured":"Anjos, M.F., Lasserre, J.B. (eds.): Handbook on Semidefinite, Conic and Polynomial Optimization, International Series in Operations Research & Management Science, vol. 166. Springer, Berlin (2012)","DOI":"10.1007\/978-1-4614-0769-0"},{"key":"866_CR6","doi-asserted-by":"crossref","unstructured":"Atamt\u00fcrk, A., Narayanan, V.: Cuts for conic mixed-integer programming. In: Fischetti, M., Williamson, D.P. (eds.) IPCO, LNCS, vol. 4513, pp. 16\u201329. Springer (2007)","DOI":"10.1007\/978-3-540-72792-7_2"},{"key":"866_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-008-0239-4","volume":"122","author":"A Atamt\u00fcrk","year":"2010","unstructured":"Atamt\u00fcrk, A., Narayanan, V.: Conic mixed-integer rounding cuts. Math. Program. 122, 1\u201320 (2010)","journal-title":"Math. Program."},{"key":"866_CR8","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1287\/opre.19.1.19","volume":"19","author":"E Balas","year":"1971","unstructured":"Balas, E.: Intersection cuts-a new type of cutting planes for integer programming. Oper. Res. 19, 19\u201339 (1971)","journal-title":"Oper. Res."},{"key":"866_CR9","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/s10107-011-0483-x","volume":"137","author":"E Balas","year":"2013","unstructured":"Balas, E., Margot, F.: Generalized intersection cuts and a new cut generating paradigm. Math. Program. 137, 19\u201335 (2013)","journal-title":"Math. Program."},{"key":"866_CR10","unstructured":"Belotti, P., G\u00f3ez, J.C., P\u00f3lik, I., Ralphs, T.K., Terlaky, T.: A conic representation of the convex hull of disjunctive sets and conic cuts for integer second order cone optimization. Optimization Online (2012). http:\/\/www.optimization-online.org\/DB_HTML\/2012\/06\/3494.html"},{"issue":"16","key":"866_CR11","doi-asserted-by":"crossref","first-page":"2778","DOI":"10.1016\/j.dam.2013.05.017","volume":"161","author":"P Belotti","year":"2013","unstructured":"Belotti, P., G\u00f3ez, J.C., P\u00f3lik, I., Ralphs, T.K., Terlaky, T.: On families of quadratic surfaces having fixed intersections with two hyperplanes. Discrete Appl. Math. 161(16), 2778\u20132793 (2013)","journal-title":"Discrete Appl. Math."},{"key":"866_CR12","unstructured":"Bienstock, D., Michalka, A.: Strong formulations for convex functions over nonconvex sets. Optimization Online (2011). http:\/\/www.optimization-online.org\/DB_HTML\/2011\/12\/3278.html"},{"issue":"2","key":"866_CR13","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1137\/120878963","volume":"24","author":"D Bienstock","year":"2014","unstructured":"Bienstock, D., Michalka, A.: Cutting-planes for optimization of convex functions over nonconvex sets. SIAM J. Optim. 24(2), 643\u2013677 (2014)","journal-title":"SIAM J. Optim."},{"key":"866_CR14","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 general mixed-integer programs. Math. Program. 131, 381\u2013401 (2012)","journal-title":"Math. Program."},{"key":"866_CR15","doi-asserted-by":"crossref","first-page":"1185","DOI":"10.1016\/j.dam.2007.12.007","volume":"157","author":"A Billionnet","year":"2009","unstructured":"Billionnet, A., Elloumi, S., Plateau, M.: Improving the performance of standard solvers for quadratic 0\u20131 programs by a tight convex reformulation: the QCR method. Discrete Appl. Math. 157, 1185\u20131197 (2009)","journal-title":"Discrete Appl. Math."},{"key":"866_CR16","doi-asserted-by":"crossref","unstructured":"Bixby, R., Fenelon, M., Gu, Z., Rothberg, E., Wunderling, R.: Mixed-integer programming: a progress report. In: The Sharpest Cut: The Impact of Manfred Padberg and his Work, chap. 18, pp. 309\u2013326. SIAM, Philadelphia (2004)","DOI":"10.1137\/1.9780898718805.ch18"},{"key":"866_CR17","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s10479-006-0091-y","volume":"149","author":"R Bixby","year":"2007","unstructured":"Bixby, R., Rothberg, E.: Progress in computational mixed integer programming\u2014a look back from the other side of the tipping point. Ann. Oper. Res. 149, 37\u201341 (2007)","journal-title":"Ann. Oper. Res."},{"key":"866_CR18","doi-asserted-by":"crossref","unstructured":"Blekherman, G., Parrilo, P., Thomas, R.: Semidefinite Optimization and Convex Algebraic Geometry. MPS-SIAM Series on Optimization. Society for Industrial and Applied Mathematics (2013)","DOI":"10.1137\/1.9781611972290"},{"key":"866_CR19","doi-asserted-by":"crossref","unstructured":"Bonami, P.: Lift-and-project cuts for mixed integer convex programs. In: Gunluk, O., Woeginger, G.J. (eds.): Proceedings of the 15th IPCO Conference, New York, NY, 2011, LNCS, vol. 6655. Springer, pp. 52\u201364 (2011)","DOI":"10.1007\/978-3-642-20807-2_5"},{"key":"866_CR20","doi-asserted-by":"crossref","unstructured":"Buchheim, C., Caprara, A., Lodi, A.: An effective branch-and-bound algorithm for convex quadratic integer programming. In: Eisenbrand, F., Shepherd, F.B. (eds.): Proceedings of the 14th IPCO Conference, Lausanne, Switzerland, 2010, LNCS, vol. 6080. Springer, pp. 285\u2013298 (2010)","DOI":"10.1007\/978-3-642-13036-6_22"},{"key":"866_CR21","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/s10107-011-0475-x","volume":"135","author":"C Buchheim","year":"2012","unstructured":"Buchheim, C., Caprara, A., Lodi, A.: An effective branch-and-bound algorithm for convex quadratic integer programming. Math. Program. 135, 369\u2013395 (2012)","journal-title":"Math. Program."},{"key":"866_CR22","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/s10107-005-0578-3","volume":"104","author":"MT \u00c7ezik","year":"2005","unstructured":"\u00c7ezik, M.T., Iyengar, G.: Cuts for mixed 0\u20131 conic programming. Math. Program. 104, 179\u2013202 (2005)","journal-title":"Math. Program."},{"key":"866_CR23","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0012-365X(73)90167-2","volume":"4","author":"V Chv\u00e1tal","year":"1973","unstructured":"Chv\u00e1tal, V.: Edmonds polytopes and a hierarchy of combinatorial problems. Discrete Math. 4, 305\u2013337 (1973)","journal-title":"Discrete Math."},{"key":"866_CR24","doi-asserted-by":"crossref","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Polyhedral approaches to mixed integer linear programming. In: 50 Years of Integer Programming 1958\u20132008, pp. 343\u2013385 (2010)","DOI":"10.1007\/978-3-540-68279-0_11"},{"key":"866_CR25","first-page":"105","volume":"16","author":"M Conforti","year":"2011","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Corner polyhedron and intersection cuts. Surv. Oper. Res. Manag. Sci. 16, 105\u2013120 (2011)","journal-title":"Surv. Oper. Res. Manag. Sci."},{"key":"866_CR26","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF01580858","volume":"47","author":"WJ Cook","year":"1990","unstructured":"Cook, W.J., Kannan, R., Schrijver, A.: Chv\u00e1tal closures for mixed integer programming problems. Math. Program. 47, 155\u2013174 (1990)","journal-title":"Math. Program."},{"key":"866_CR27","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10107-006-0086-0","volume":"112","author":"G Cornu\u00e9jols","year":"2008","unstructured":"Cornu\u00e9jols, G.: Valid inequalities for mixed integer linear programs. Math. Program. 112, 3\u201344 (2008)","journal-title":"Math. Program."},{"key":"866_CR28","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1287\/moor.1110.0488","volume":"36","author":"D Dadush","year":"2011","unstructured":"Dadush, D., Dey, S.S., Vielma, J.P.: The Chv\u00e1tal-Gomory closure of a strictly convex body. Math. Oper. Res. 36, 227\u2013239 (2011)","journal-title":"Math. Oper. Res."},{"key":"866_CR29","doi-asserted-by":"crossref","unstructured":"Dadush, D., Dey, S.S., Vielma, J.P.: On the Chv\u00e1tal-Gomory closure of a compact convex set. In: Gunluk, O., Woeginger, G.J. (eds.): Proceedings of the 15th IPCO Conference, New York, NY, 2011, LNCS, vol. 6655. Springer, pp. 130\u2013142 (2011)","DOI":"10.1007\/978-3-642-20807-2_11"},{"key":"866_CR30","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/j.orl.2011.02.002","volume":"39","author":"D Dadush","year":"2011","unstructured":"Dadush, D., Dey, S.S., Vielma, J.P.: The split closure of a strictly convex body. Oper. Res. Lett. 39, 121\u2013126 (2011)","journal-title":"Oper. Res. Lett."},{"key":"866_CR31","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10107-011-0455-1","volume":"135","author":"S Dash","year":"2012","unstructured":"Dash, S., Dey, S.S., G\u00fcnl\u00fck, O.: Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra. Math. Program. 135, 221\u2013254 (2012)","journal-title":"Math. Program."},{"key":"866_CR32","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1016\/j.orl.2011.02.011","volume":"39","author":"S Dash","year":"2011","unstructured":"Dash, S., G\u00fcnl\u00fck, O., Raack, C.: A note on the MIR closure and basic relaxations of polyhedra. Oper. Res. Lett. 39, 198\u2013199 (2011)","journal-title":"Oper. Res. Lett."},{"key":"866_CR33","doi-asserted-by":"crossref","first-page":"780","DOI":"10.1287\/ijoc.2014.0598","volume":"26","author":"S Dash","year":"2014","unstructured":"Dash, S., G\u00fcnl\u00fck, O., Vielma, J.P.: Computational experiments with cross and crooked cross cuts. INFORMS J. Comput. 26, 780\u2013797 (2014)","journal-title":"INFORMS J. Comput."},{"key":"866_CR34","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10288-012-0198-8","volume":"10","author":"A Pia Del","year":"2012","unstructured":"Del Pia, A., Weismantel, R.: Relaxations of mixed integer sets from lattice-free polyhedra. 4OR Q. J. Oper. Res. 10, 1\u201324 (2012)","journal-title":"4OR Q. J. Oper. Res."},{"key":"866_CR35","doi-asserted-by":"crossref","unstructured":"Dey, S.S., Vielma, J.P.: The Chv\u00e1tal-Gomory closure of an ellipsoid is a polyhedron. In: Eisenbrand, F., Shepherd, F.B. (eds.): Proceedings of the 14th IPCOConference, Lausanne, Switzerland, 2010, LNCS, vol. 6080. Springer, pp. 327\u2013340 (2010)","DOI":"10.1007\/978-3-642-13036-6_25"},{"key":"866_CR36","unstructured":"Drewes, S.: Mixed integer second order cone programming. Ph.D. thesis, Technische Universit\u00e4t Darmstadt (2009)"},{"key":"866_CR37","unstructured":"Eisenbrand, F., Shepherd, F.B. (eds.): Proceedings of the 14th IPCO Conference, Lausanne, Switzerland, 2010, LNCS, vol. 6080. Springer (2010)"},{"key":"866_CR38","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1023\/A:1008282830093","volume":"10","author":"T Fujie","year":"1997","unstructured":"Fujie, T., Kojima, M.: Semidefinite programming relaxation for nonconvex quadratic programs. J. Glob. Optim. 10, 367\u2013380 (1997)","journal-title":"J. Glob. Optim."},{"key":"866_CR39","doi-asserted-by":"crossref","unstructured":"Giandomenico, M., Letchford, A.N., Rossi, F., Smriglio, S.: A new approach to the stable set problem based on ellipsoids. In: Gunluk, O., Woeginger, G.J. (eds.): Proceedings of the 15th IPCO Conference, New York, NY, 2011, LNCS, vol. 6655. Springer, pp. 223\u2013234 (2011)","DOI":"10.1007\/978-3-642-20807-2_18"},{"key":"866_CR40","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1090\/S0002-9904-1958-10224-4","volume":"64","author":"RE Gomory","year":"1958","unstructured":"Gomory, R.E.: Outline of an algorithm for integer solutions to linear programs. Bull. Am. Math. Soc. 64, 275\u2013278 (1958)","journal-title":"Bull. Am. Math. Soc."},{"key":"866_CR41","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/0024-3795(69)90017-2","volume":"2","author":"RE Gomory","year":"1969","unstructured":"Gomory, R.E.: Some polyhedra related to combinatorial problems. Linear Algebra Appl. 2, 451\u2013558 (1969)","journal-title":"Linear Algebra Appl."},{"key":"866_CR42","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF01584976","volume":"3","author":"RE Gomory","year":"1972","unstructured":"Gomory, R.E., Johnson, E.L.: Some continuous functions related to corner polyhedra. Math. Program. 3, 23\u201385 (1972)","journal-title":"Math. Program."},{"key":"866_CR43","doi-asserted-by":"crossref","unstructured":"Gouveia, J., Thomas, R.: Convex hulls of algebraic sets. In: Anjos, M.F., Lasserre, J.B. (eds.): Handbook on Semidefinite, Conic and Polynomial Optimization, International Series in Operations Research & Management Science, vol. 166. Springer, Berlin, pp. 113\u2013138 (2012)","DOI":"10.1007\/978-1-4614-0769-0_5"},{"key":"866_CR44","unstructured":"G\u00fcnl\u00fck, O., Woeginger, G.J. (eds.): Proceedings of the 15th IPCO Conference, New York, NY, 2011, LNCS, vol. 6655. Springer (2011)"},{"key":"866_CR45","doi-asserted-by":"crossref","unstructured":"Helton, J.W., Nie, J.: Semidefinite representation of convex sets and convex hulls. In: Anjos, M.F., Lasserre, J.B. (eds.): Handbook on Semidefinite, Conic and Polynomial Optimization, International Series in Operations Research & Management Science, vol. 166. Springer, Berlin, pp. 77\u2013112 (2012)","DOI":"10.1007\/978-1-4614-0769-0_4"},{"key":"866_CR46","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/s10440-011-9623-9","volume":"115","author":"D Henrion","year":"2011","unstructured":"Henrion, D.: Semidefinite representation of convex hulls of rational varieties. Acta applicandae mathematicae 115, 319\u2013327 (2011)","journal-title":"Acta applicandae mathematicae"},{"key":"866_CR47","volume-title":"Global Optimization: Deterministic Approaches","author":"R Horst","year":"2003","unstructured":"Horst, R., Tuy, H.: Global Optimization: Deterministic Approaches. Springer, Berlin (2003)"},{"key":"866_CR48","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1287\/ijoc.12.1.2.11900","volume":"12","author":"EL Johnson","year":"2000","unstructured":"Johnson, E.L., Nemhauser, G.L., Savelsbergh, M.W.P.: Progress in linear programming-based algorithms for integer programming: an exposition. INFORMS J. Comput. 12, 2\u201323 (2000)","journal-title":"INFORMS J. Comput."},{"key":"866_CR49","unstructured":"K\u0131l\u0131n\u00e7, M.R., Modaresi, S., Vielma, J.P.: Split cuts for conic programming. 9th Mixed Integer Programming Workshop (MIP 2012), July 16\u201319, 2012, Davis, CA, Poster (2012). https:\/\/www.math.ucdavis.edu\/static\/conferences\/mip_2012\/posters\/poster-sina-modaresi"},{"key":"866_CR50","unstructured":"K\u0131l\u0131n\u00e7, M.R., Linderoth, J., Luedtke, J.: Effective separation of disjunctive cuts for convex mixed integer nonlinear programs. Tech. rep., University of Wisconsin-Madison (2010)"},{"key":"866_CR51","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1137\/S1052623498336450","volume":"10","author":"M Kojima","year":"2000","unstructured":"Kojima, M., Tun\u00e7el, L.: Cones of matrices and successive convex relaxations of nonconvex sets. SIAM J. Optim. 10, 750\u2013778 (2000)","journal-title":"SIAM J. Optim."},{"key":"866_CR52","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"J Lasserre","year":"2001","unstructured":"Lasserre, J.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11, 796\u2013817 (2001)","journal-title":"SIAM J. Optim."},{"key":"866_CR53","doi-asserted-by":"crossref","first-page":"724","DOI":"10.1016\/j.disopt.2008.05.002","volume":"5","author":"Y Li","year":"2008","unstructured":"Li, Y., Richard, J.P.P.: Cook, Kannan and Schrijvers example revisited. Discrete Optim. 5, 724\u2013734 (2008)","journal-title":"Discrete Optim."},{"key":"866_CR54","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-68279-0_16","volume-title":"Mixed Integer Programming Computation","author":"A Lodi","year":"2010","unstructured":"Lodi, A.: Mixed Integer Programming Computation. Springer, New York (2010). chap. 16, pp. 619\u2013645"},{"key":"866_CR55","first-page":"177","volume-title":"Mathematical Programming: Recent Developments and Applications","author":"L Lov\u00e1sz","year":"1989","unstructured":"Lov\u00e1sz, L.: Geometry of numbers and integer programming. In: Iri, M., Tanabe, K. (eds.) Mathematical Programming: Recent Developments and Applications, pp. 177\u2013210. Kluwer, Dordrecht (1989)"},{"key":"866_CR56","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1287\/opre.49.3.363.11211","volume":"49","author":"H Marchand","year":"2001","unstructured":"Marchand, H., Wolsey, L.: Aggregation and mixed integer rounding to solve MIPs. Oper. Res. 49, 363\u2013371 (2001)","journal-title":"Oper. Res."},{"key":"866_CR57","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Goldwasser, S.: Complexity of Lattice Problems: A Cryptographic Perspective, The Kluwer International Series in Engineering and Computer Science, vol. 671. Kluwer (2002)","DOI":"10.1007\/978-1-4615-0897-7"},{"key":"866_CR58","doi-asserted-by":"crossref","unstructured":"Modaresi, S., K\u0131l\u0131n\u00e7, M.R., Vielma, J.P.: Split cuts and extended formulations for mixed integer conic quadratic programming. Oper. Res. Lett. 43,10\u201315 (2015)","DOI":"10.1016\/j.orl.2014.10.006"},{"issue":"3","key":"866_CR59","doi-asserted-by":"crossref","first-page":"1136","DOI":"10.1137\/110840868","volume":"22","author":"R Moran","year":"2012","unstructured":"Moran, R., Dey, D.A., Vielma, S.S.: A strong dual for conic mixed-integer programs. SIAM J. Optim. 22(3), 1136\u20131150 (2012)","journal-title":"SIAM J. Optim."},{"key":"866_CR60","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"GL Nemhauser","year":"1988","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)"},{"key":"866_CR61","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/BF01585752","volume":"46","author":"GL Nemhauser","year":"1990","unstructured":"Nemhauser, G.L., Wolsey, L.A.: A recursive procedure to generate all cuts for 0\u20131 mixed integer programs. Math. Program. 46, 379\u2013390 (1990)","journal-title":"Math. Program."},{"key":"866_CR62","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/978-1-4615-4381-7_13","volume-title":"Handbook of Semidefinite Programming","author":"Y Nesterov","year":"2000","unstructured":"Nesterov, Y., Wolkowicz, H., Ye, Y.: Nonconvex quadratic optimization. In: Saigal, R., Vandenberghe, L., Wolkowicz, H. (eds.) Handbook of Semidefinite Programming, pp. 361\u2013420. Kluwer Academic Publishers, Dordrecht (2000)"},{"key":"866_CR63","doi-asserted-by":"crossref","unstructured":"Oustry, C.: SDP relaxations in combinatorial optimization from a Lagrangian viewpoint. In: Advances in Convex Analysis and Global Optimization: Honoring the Memory of C. Caratheodory (1873\u20131950), vol. 54, pp. 119\u2013134 (2001)","DOI":"10.1007\/978-1-4613-0279-7_6"},{"issue":"2","key":"866_CR64","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/s10107-003-0387-5","volume":"96","author":"PA Parrilo","year":"2003","unstructured":"Parrilo, P.A.: Semidefinite programming relaxations for semialgebraic problems. Math. Program. 96(2), 293\u2013320 (2003)","journal-title":"Math. Program."},{"key":"866_CR65","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1137\/S003614450444614X","volume":"49","author":"I P\u00f3lik","year":"2007","unstructured":"P\u00f3lik, I., Terlaky, T.: A survey of the S-lemma. SIAM Rev. 49, 371\u2013418 (2007)","journal-title":"SIAM Rev."},{"key":"866_CR66","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/BF01100205","volume":"7","author":"S Poljak","year":"1995","unstructured":"Poljak, S., Rendl, F., Wolkowicz, H.: A recipe for semidefinite relaxation for (0, 1)-quadratic programming. J. Glob. Optim. 7, 51\u201373 (1995)","journal-title":"J. Glob. Optim."},{"key":"866_CR67","doi-asserted-by":"crossref","unstructured":"Ranestad, K., Sturmfels, B.: The convex hull of a variety. In: Notions of Positivity and the Geometry of Polynomials, pp. 331\u2013344 (2011)","DOI":"10.1007\/978-3-0348-0142-3_18"},{"key":"866_CR68","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1515\/advgeom.2011.021","volume":"12","author":"K Ranestad","year":"2012","unstructured":"Ranestad, K., Sturmfels, B.: On the convex hull of a space curve. Adv. Geom. 12, 157\u2013178 (2012)","journal-title":"Adv. Geom."},{"key":"866_CR69","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1112\/S002557931100132X","volume":"57","author":"R Sanyal","year":"2011","unstructured":"Sanyal, R., Sottile, F., Sturmfels, B.: Orbitopes. Mathematika 57, 275\u2013314 (2011)","journal-title":"Mathematika"},{"key":"866_CR70","doi-asserted-by":"crossref","first-page":"2606","DOI":"10.1016\/j.aim.2011.07.014","volume":"228","author":"C Scheiderer","year":"2011","unstructured":"Scheiderer, C.: Convex hulls of curves of genus one. Adv. Math. 228, 2606\u20132622 (2011)","journal-title":"Adv. Math."},{"key":"866_CR71","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, vol. 31. Springer, Berlin (1998)"},{"key":"866_CR72","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/s101070050103","volume":"86","author":"RA Stubbs","year":"1999","unstructured":"Stubbs, R.A., Mehrotra, S.: A branch-and-cut method for 0\u20131 mixed convex programming. Math. Program. 86, 515\u2013532 (1999)","journal-title":"Math. Program."},{"key":"866_CR73","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.: Convexification and Global Optimization in Continuous and Mixed-integer Nonlinear Programming: Theory, Algorithms, Software, and Applications, vol. 65. Springer, Berlin (2002)"},{"key":"866_CR74","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/j.orl.2005.12.005","volume":"35","author":"JP Vielma","year":"2007","unstructured":"Vielma, J.P.: A constructive characterization of the split closure of a mixed integer linear program. Oper. Res. Lett. 35, 29\u201335 (2007)","journal-title":"Oper. Res. Lett."},{"key":"866_CR75","volume-title":"Integer Programming","author":"LA Wolsey","year":"1998","unstructured":"Wolsey, L.A.: Integer Programming. Wiley, New York (1998)"},{"key":"866_CR76","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1093\/imamci\/dnp023","volume":"26","author":"U Y\u0131ld\u0131ran","year":"2009","unstructured":"Y\u0131ld\u0131ran, U.: Convex hull of two quadratic constraints is an LMI set. IMA J. Math. Control Inf. 26, 417\u2013450 (2009)","journal-title":"IMA J. Math. Control Inf."},{"key":"866_CR77","first-page":"535","volume":"17","author":"U Y\u0131ld\u0131ran","year":"2010","unstructured":"Y\u0131ld\u0131ran, U., Kose, I.E.: LMI representations of the convex hulls of quadratic basic semialgebraic sets. J. Convex Anal. 17, 535\u2013551 (2010)","journal-title":"J. Convex Anal."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0866-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-015-0866-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0866-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,20]],"date-time":"2019-08-20T20:23:25Z","timestamp":1566332605000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-015-0866-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,17]]},"references-count":77,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["866"],"URL":"https:\/\/doi.org\/10.1007\/s10107-015-0866-5","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,17]]}}}