{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:40:28Z","timestamp":1740109228015,"version":"3.37.3"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2016,11,9]],"date-time":"2016-11-09T00:00:00Z","timestamp":1478649600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,11,9]],"date-time":"2016-11-09T00:00:00Z","timestamp":1478649600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI-1030662","CMMI-1030662"],"award-info":[{"award-number":["CMMI-1030662","CMMI-1030662"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1007\/s10107-016-1084-5","type":"journal-article","created":{"date-parts":[[2016,11,9]],"date-time":"2016-11-09T04:04:53Z","timestamp":1478664293000},"page":"383-409","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Convex hull of two quadratic or a conic quadratic and a quadratic inequality"],"prefix":"10.1007","volume":"164","author":[{"given":"Sina","family":"Modaresi","sequence":"first","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":[[2016,11,9]]},"reference":[{"key":"1084_CR1","doi-asserted-by":"publisher","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":"1084_CR2","first-page":"37","volume-title":"IPCO Conference, LNCS","author":"K Andersen","year":"2013","unstructured":"Andersen, K., Jensen, A.: Intersection cuts for mixed integer conic quadratic sets. In: Goemans, M., Correa, J. (eds.) IPCO Conference, LNCS, vol. 7801, pp. 37\u201348. Springer, Berlin (2013)"},{"key":"1084_CR3","first-page":"16","volume-title":"IPCO, LNCS","author":"A Atamt\u00fcrk","year":"2007","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, Berlin (2007)"},{"key":"1084_CR4","doi-asserted-by":"publisher","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":"1084_CR5","doi-asserted-by":"crossref","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. In: Al-Baali, M., Grandinetti, L., Purnama, A. (eds.) Numerical Analysis and Optimization, Springer Proceedings in Mathematics and Statistics, vol. 134, pp. 1\u201335. Springer, Switzerland (2015)","DOI":"10.1007\/978-3-319-17689-5_1"},{"issue":"16","key":"1084_CR6","doi-asserted-by":"publisher","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":"1084_CR7","unstructured":"Belotti, P., G\u00f3ez, J.C., P\u00f3lik, I., Ralphs, T.K., Terlaky, T.: Disjunctive conic cuts for mixed integer second order cone optimization. \n                    http:\/\/coral.ie.lehigh.edu\/~ted\/files\/papers\/ConicCuts14\n                    \n                   (2014)"},{"issue":"1","key":"1084_CR8","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/BF02592331","volume":"72","author":"A Ben-Tal","year":"1996","unstructured":"Ben-Tal, A., Teboulle, M.: Hidden convexity in some nonconvex quadratically constrained quadratic programming. Math. Program. 72(1), 51\u201363 (1996)","journal-title":"Math. Program."},{"key":"1084_CR9","unstructured":"Bienstock, D., Michalka, A.: Strong formulations for convex functions over nonconvex sets. Optimization online. \n                    http:\/\/www.optimization-online.org\/DB_HTML\/2011\/12\/3278.html\n                    \n                   (2011)"},{"issue":"2","key":"1084_CR10","doi-asserted-by":"publisher","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":"1084_CR11","doi-asserted-by":"crossref","unstructured":"Bixby, R., Fenelon, M., Gu, Z., Rothberg, E., Wunderling, R.: Mixed-integer programming: a progress report. In: Gr\u00f6tschel, M. (ed.). The Sharpest Cut: The Impact of Manfred Padberg and His Work, chap. 18, pp. 309\u2013326. SIAM, Philadelphia, PA (2004)","DOI":"10.1137\/1.9780898718805.ch18"},{"key":"1084_CR12","doi-asserted-by":"publisher","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":"1084_CR13","doi-asserted-by":"crossref","unstructured":"Bonami, P.: Lift-and-project cuts for mixed integer convex programs. In: G\u00fcnl\u00fck, O., Woeginger, G.J. (eds.). Proceedings of the 15th IPCO Conference, LNCS, vol. 6655, pp. 52\u201364. Springer, New York (2011)","DOI":"10.1007\/978-3-642-20807-2_5"},{"key":"1084_CR14","unstructured":"Burer, S., K\u0131l\u0131n\u00e7-Karzan, F.: Personal communication (2014)"},{"key":"1084_CR15","unstructured":"Burer, S., K\u0131l\u0131n\u00e7-Karzan, F.: How to convexify the intersection of a second order cone and a nonconvex quadratic. arXiv preprint \n                    arXiv:1406.1031\n                    \n                  . \n                    http:\/\/arxiv.org\/abs\/1406.1031\n                    \n                   (2014)"},{"key":"1084_CR16","doi-asserted-by":"publisher","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":"1084_CR17","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":"1084_CR18","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":"1084_CR19","doi-asserted-by":"publisher","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":"1084_CR20","doi-asserted-by":"publisher","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":"1084_CR21","doi-asserted-by":"publisher","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\u2013Gomory closure of a strictly convex body. Math. Oper. Res. 36, 227\u2013239 (2011)","journal-title":"Math. Oper. Res."},{"key":"1084_CR22","doi-asserted-by":"publisher","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":"1084_CR23","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10107-013-0649-9","volume":"145","author":"D Dadush","year":"2014","unstructured":"Dadush, D., Dey, S.S., Vielma, J.P.: On the Chv\u00e1tal\u2013Gomory closure of a compact convex set. Math. Program. 145, 327\u2013348 (2014)","journal-title":"Math. Program."},{"key":"1084_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10288-012-0200-5","volume":"10","author":"A Del Pia","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":"1084_CR25","unstructured":"Drewes, S.: Mixed integer second order cone programming. Ph.D. thesis, Technische Universit\u00e4t Darmstadt (2009)"},{"key":"1084_CR26","volume-title":"Fundamentals of Convex Analysis","author":"J-B Hiriart-Urruty","year":"2012","unstructured":"Hiriart-Urruty, J.-B., Lemar\u00e9chal, C.: Fundamentals of Convex Analysis. Springer, Berlin (2012)"},{"key":"1084_CR27","doi-asserted-by":"publisher","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":"1084_CR28","doi-asserted-by":"publisher","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":"1084_CR29","doi-asserted-by":"publisher","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":"1084_CR30","unstructured":"K\u0131l\u0131n\u00e7, M.R., Linderoth, J., Luedtke, J.: Effective separation of disjunctive cuts for convex mixed integer nonlinear programs. Optimization online. \n                    http:\/\/www.optimization-online.org\/DB_HTML\/2010\/11\/2808.html\n                    \n                   (2010)"},{"issue":"2","key":"1084_CR31","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1287\/moor.2015.0737","volume":"41","author":"F K\u0131l\u0131n\u00e7-Karzan","year":"2015","unstructured":"K\u0131l\u0131n\u00e7-Karzan, F.: On minimal valid inequalities for mixed integer conic programs. Math. Oper. Res. 41(2), 477\u2013510 (2015)","journal-title":"Math. Oper. Res."},{"issue":"1\u20132","key":"1084_CR32","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/s10107-015-0903-4","volume":"154","author":"F K\u0131l\u0131n\u00e7-Karzan","year":"2015","unstructured":"K\u0131l\u0131n\u00e7-Karzan, F., Y\u0131ld\u0131z, S.: Two-term disjunctions on the second-order cone. Math. Program. 154(1\u20132), 463\u2013491 (2015)","journal-title":"Math. Program."},{"key":"1084_CR33","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1007\/978-3-540-68279-0_16","volume-title":"50 Years of Integer Programming 1958\u20132008: From the Early Years to the State-of-the-Art, Chap 16","author":"A Lodi","year":"2010","unstructured":"Lodi, A.: Mixed integer programming computation. In: J\u00fcnger, M., Liebling, T., Naddef, D., Nemhauser, G., Pulleyblank, W., Reinelt, G., Rinaldi, G., Wolsey, L. (eds.) 50 Years of Integer Programming 1958\u20132008: From the Early Years to the State-of-the-Art, Chap 16, pp. 619\u2013645. Springer, New York (2010)"},{"key":"1084_CR34","doi-asserted-by":"publisher","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":"1084_CR35","unstructured":"Modaresi, S.: Valid inequalities and reformulation techniques for mixed integer nonlinear programming. Ph.D. thesis, University of Pittsburgh (2015)"},{"key":"1084_CR36","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/s10107-015-0866-5","volume":"155","author":"S Modaresi","year":"2016","unstructured":"Modaresi, S., K\u0131l\u0131n\u00e7, M.R., Vielma, J.P.: Intersection cuts for nonlinear integer programming: convexification techniques for structured sets. Math. Program. 155, 575\u2013611 (2016)","journal-title":"Math. Program."},{"issue":"1","key":"1084_CR37","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.orl.2014.10.006","volume":"43","author":"S Modaresi","year":"2015","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(1), 10\u201315 (2015)","journal-title":"Oper. Res. Lett."},{"key":"1084_CR38","unstructured":"Modaresi, S., Vielma, J.P.: The power of a negative eigenvalue: aggregation cuts for nonlinear integer programming. In: 2014 Mixed Integer Programming Workshop, July 21\u201324, 2014, Columbus, OH, Poster. \n                    https:\/\/mip2014.engineering.osu.edu\/sites\/mip2014.engineering.osu.edu\/files\/uploads\/Sina-Modaresi\n                    \n                   (2014)"},{"key":"1084_CR39","unstructured":"Modaresi, S., K\u0131l\u0131n\u00e7, M.R., Vielma, J.P.: Split cuts for conic programming. In: Poster presented at the MIP 2012 Workshop at UC Davis (2012)"},{"issue":"3","key":"1084_CR40","doi-asserted-by":"publisher","first-page":"1136","DOI":"10.1137\/110840868","volume":"22","author":"DA Moran","year":"2012","unstructured":"Moran, D.A., Dey, S.S., Vielma, J.P.: A strong dual for conic mixed-integer programs. SIAM J. Optim. 22(3), 1136\u20131150 (2012)","journal-title":"SIAM J. Optim."},{"key":"1084_CR41","doi-asserted-by":"publisher","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":"1084_CR42","doi-asserted-by":"publisher","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":"1084_CR43","doi-asserted-by":"publisher","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":"1084_CR44","volume-title":"Integer Programming","author":"LA Wolsey","year":"1998","unstructured":"Wolsey, L.A.: Integer Programming. Wiley, New York (1998)"},{"key":"1084_CR45","doi-asserted-by":"publisher","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."},{"issue":"4","key":"1084_CR46","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1016\/j.orl.2015.06.001","volume":"43","author":"S Y\u0131ld\u0131z","year":"2015","unstructured":"Y\u0131ld\u0131z, S., Cornu\u00e9jols, G.: Disjunctive cuts for cross-sections of the second-order cone. Oper. Res. Lett. 43(4), 432\u2013437 (2015)","journal-title":"Oper. Res. Lett."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-016-1084-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1084-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1084-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T16:17:45Z","timestamp":1589645865000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-016-1084-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,9]]},"references-count":46,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["1084"],"URL":"https:\/\/doi.org\/10.1007\/s10107-016-1084-5","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2016,11,9]]},"assertion":[{"value":"19 October 2014","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 October 2016","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 November 2016","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}