{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,19]],"date-time":"2025-08-19T09:57:33Z","timestamp":1755597453335,"version":"3.37.3"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2021,11,30]],"date-time":"2021-11-30T00:00:00Z","timestamp":1638230400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,11,30]],"date-time":"2021-11-30T00:00:00Z","timestamp":1638230400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002850","name":"ondo Nacional de Desarrollo Cient\u00edfico y Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["11190515"],"award-info":[{"award-number":["11190515"]}],"id":[{"id":"10.13039\/501100002850","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002347","name":"Bundesministerium f\u00fcr Bildung und Forschung","doi-asserted-by":"publisher","award":["05M14ZAM","05M20ZBM"],"award-info":[{"award-number":["05M14ZAM","05M20ZBM"]}],"id":[{"id":"10.13039\/501100002347","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003161","name":"Forschungskuratorium Textil, Bundesministerium f\u00fcr Wirtschaft und Energie","doi-asserted-by":"publisher","award":["EnBA-M (ID: 03ET1549D)"],"award-info":[{"award-number":["EnBA-M (ID: 03ET1549D)"]}],"id":[{"id":"10.13039\/501100003161","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1007\/s10107-021-01738-8","type":"journal-article","created":{"date-parts":[[2021,11,30]],"date-time":"2021-11-30T19:13:22Z","timestamp":1638299602000},"page":"229-270","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Maximal quadratic-free sets"],"prefix":"10.1007","volume":"192","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9003-441X","authenticated-orcid":false,"given":"Gonzalo","family":"Mu\u00f1oz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7892-3951","authenticated-orcid":false,"given":"Felipe","family":"Serrano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,11,30]]},"reference":[{"key":"1738_CR1","doi-asserted-by":"crossref","unstructured":"Andersen, K., Jensen, A.N.: Intersection cuts for mixed integer conic quadratic sets. In: Goemans, M., Correa, J. (eds.) Integer Programming And Combinatorial Optimization, pp. 37\u201348. Springer (2013)","DOI":"10.1007\/978-3-642-36694-9_4"},{"issue":"1","key":"1738_CR2","doi-asserted-by":"publisher","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(1), 233\u2013256 (2010)","journal-title":"Math. Oper. Res."},{"key":"1738_CR3","doi-asserted-by":"publisher","unstructured":"Andersen, K., Louveaux, Q., Weismantel, R., Wolsey, L.A.: Inequalities from two rows of a simplex tableau. In: Integer Programming and Combinatorial Optimization, pp. 1\u201315. Springer, Berlin (2007). https:\/\/doi.org\/10.1007\/978-3-540-72792-7_1","DOI":"10.1007\/978-3-540-72792-7_1"},{"issue":"1","key":"1738_CR4","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1287\/opre.19.1.19","volume":"19","author":"E Balas","year":"1971","unstructured":"Balas, E.: Intersection cuts\u2013a new type of cutting planes for integer programming. Oper. Res. 19(1), 19\u201339 (1971). https:\/\/doi.org\/10.1287\/opre.19.1.19","journal-title":"Oper. Res."},{"issue":"3","key":"1738_CR5","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1287\/moor.1100.0461","volume":"35","author":"A Basu","year":"2010","unstructured":"Basu, A., Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Maximal lattice-free convex sets in linear subspaces. Math. Oper. Res. 35(3), 704\u2013720 (2010). https:\/\/doi.org\/10.1287\/moor.1100.0461","journal-title":"Math. Oper. Res."},{"issue":"1","key":"1738_CR6","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1137\/090756375","volume":"24","author":"A Basu","year":"2010","unstructured":"Basu, A., Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Minimal inequalities for an infinite relaxation of integer programs. SIAM J. Discrete Math. 24(1), 158\u2013168 (2010)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"1738_CR7","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1137\/17m1117070","volume":"33","author":"A Basu","year":"2019","unstructured":"Basu, A., Dey, S.S., Paat, J.: Nonunique lifting of integer variables in minimal inequalities. SIAM J. Discrete Math. 33(2), 755\u2013783 (2019). https:\/\/doi.org\/10.1137\/17m1117070","journal-title":"SIAM J. Discrete Math."},{"issue":"16\u201317","key":"1738_CR8","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\u201317), 2778\u20132793 (2013)","journal-title":"Discrete Appl. Math."},{"key":"1738_CR9","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: Numerical Analysis and Optimization, pp. 1\u201335. Springer (2015)","DOI":"10.1007\/978-3-319-17689-5_1"},{"key":"1738_CR10","doi-asserted-by":"crossref","unstructured":"Bienstock, D., Chen, C., Mu\u00f1oz, G.: Outer-product-free sets for polynomial optimization and oracle-based cuts. Math. Program 1\u201344 (2020)","DOI":"10.1007\/s10107-020-01484-3"},{"key":"1738_CR11","doi-asserted-by":"publisher","unstructured":"Bienstock, D., Chen, C., Mu\u00f1oz, G.: Intersection cuts for polynomial optimization. In: Integer Programming and Combinatorial Optimization, pp. 72\u201387. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-17953-3_6","DOI":"10.1007\/978-3-030-17953-3_6"},{"issue":"1\u20132","key":"1738_CR12","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s10107-016-1005-7","volume":"161","author":"M Bodur","year":"2017","unstructured":"Bodur, M., Dash, S., G\u00fcnl\u00fck, O.: Cutting planes from extended lp formulations. Math. Program. 161(1\u20132), 159\u2013192 (2017)","journal-title":"Math. Program."},{"key":"1738_CR13","unstructured":"Bonami, P., Linderoth, J., Lodi, A.: Disjunctive cuts for mixed integer nonlinear programming problems. Progress in Combinatorial Optimization, pp. 521\u2013541 (2011)"},{"issue":"3","key":"1738_CR14","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.1080.0370","volume":"34","author":"V Borozan","year":"2009","unstructured":"Borozan, V., Cornu\u00e9jols, G.: Minimal valid inequalities for integer constraints. Math. Oper. Res. 34(3), 538\u2013546 (2009). https:\/\/doi.org\/10.1287\/moor.1080.0370","journal-title":"Math. Oper. Res."},{"key":"1738_CR15","doi-asserted-by":"crossref","unstructured":"Boyd, S., Boyd, S.P., Vandenberghe, L.: Convex Optimization. Cambridge University Press (2004)","DOI":"10.1017\/CBO9780511804441"},{"issue":"1\u20132","key":"1738_CR16","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/s10107-016-1045-z","volume":"162","author":"S Burer","year":"2017","unstructured":"Burer, S., K\u0131l\u0131n\u00e7-Karzan, F.: How to convexify the intersection of a second order cone and a nonconvex quadratic. Math. Program. 162(1\u20132), 393\u2013429 (2017)","journal-title":"Math. Program."},{"key":"1738_CR17","unstructured":"Chmiela, A., Mu\u00f1oz, G., Serrano, F.: On the implementation and strengthening of intersection cuts for qcqps. Tech. Rep. 20-29, ZIB, Takustr. 7, 14195 Berlin (2020)"},{"key":"1738_CR18","doi-asserted-by":"crossref","unstructured":"Chmiela, A., Mu\u00f1oz, G., Serrano, F.: On the implementation and strengthening of intersection cuts for qcqps. In: IPCO, pp. 134\u2013147 (2021)","DOI":"10.1007\/978-3-030-73879-2_10"},{"issue":"2","key":"1738_CR19","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1287\/moor.2014.0670","volume":"40","author":"M Conforti","year":"2015","unstructured":"Conforti, M., Cornu\u00e9jols, G., Daniilidis, A., Lemar\u00e9chal, C., Malick, J.: Cut-generating functions and S-free sets. Math. Oper. Res. 40(2), 276\u2013391 (2015). https:\/\/doi.org\/10.1287\/moor.2014.0670","journal-title":"Math. Oper. Res."},{"issue":"2","key":"1738_CR20","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.sorms.2011.03.001","volume":"16","author":"M Conforti","year":"2011","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Corner polyhedron and intersection cuts. Sur. Oper. Res. Manag. Sci. 16(2), 105\u2013120 (2011). https:\/\/doi.org\/10.1016\/j.sorms.2011.03.001","journal-title":"Sur. Oper. Res. Manag. Sci."},{"key":"1738_CR21","doi-asserted-by":"crossref","unstructured":"Conforti, M., Cornuejols, G., Zambelli, G.: Integer Programming. Springer (2014)","DOI":"10.1007\/978-3-319-11008-0"},{"issue":"1\u20132","key":"1738_CR22","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/s10107-014-0780-2","volume":"152","author":"G Cornu\u00e9jols","year":"2015","unstructured":"Cornu\u00e9jols, G., Wolsey, L., Y\u0131ld\u0131z, S.: Sufficiency of cut-generating functions. Math. Program. 152(1\u20132), 643\u2013651 (2015)","journal-title":"Math. Program."},{"key":"1738_CR23","doi-asserted-by":"crossref","unstructured":"Dey, S.S., Wolsey, L.A.: Lifting integer variables in minimal inequalities corresponding to lattice-free triangles. In: Lodi, A., Panconesi, A., Rinaldi, G. (eds.) Integer Programming and Combinatorial Optimization, pp. 463\u2013475. Springer (2008)","DOI":"10.1007\/978-3-540-68891-4_32"},{"issue":"6","key":"1738_CR24","doi-asserted-by":"publisher","first-page":"2890","DOI":"10.1137\/090754388","volume":"20","author":"SS Dey","year":"2010","unstructured":"Dey, S.S., Wolsey, L.A.: Constrained infinite group relaxations of MIPs. SIAM J. Optim. 20(6), 2890\u20132912 (2010). https:\/\/doi.org\/10.1137\/090754388","journal-title":"SIAM J. Optim."},{"key":"1738_CR25","doi-asserted-by":"publisher","unstructured":"Fischetti, M., Ljubi\u0107, I., Monaci, M., Sinnl, M.: Intersection cuts for bilevel optimization. In: Integer Programming and Combinatorial Optimization, pp. 77\u201388. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-319-33461-5_7","DOI":"10.1007\/978-3-319-33461-5_7"},{"key":"1738_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2019.09.043","author":"M Fischetti","year":"2019","unstructured":"Fischetti, M., Monaci, M.: A branch-and-cut algorithm for mixed-integer bilinear programming. Eur. J. Oper. Res. (2019). https:\/\/doi.org\/10.1016\/j.ejor.2019.09.043","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"1738_CR27","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1287\/opre.21.1.123","volume":"21","author":"F Glover","year":"1973","unstructured":"Glover, F.: Convexity cuts and cut search. Oper. Res. 21(1), 123\u2013134 (1973). https:\/\/doi.org\/10.1287\/opre.21.1.123","journal-title":"Oper. Res."},{"issue":"1","key":"1738_CR28","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.jmaa.2009.10.015","volume":"364","author":"M Goberna","year":"2010","unstructured":"Goberna, M., Gonz\u00e1lez, E., Mart\u00ednez-Legaz, J., Todorov, M.: Motzkin decomposition of closed convex sets. J. Math. Anal. Appl. 364(1), 209\u2013221 (2010). https:\/\/doi.org\/10.1016\/j.jmaa.2009.10.015","journal-title":"J. Math. Anal. Appl."},{"issue":"1","key":"1738_CR29","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/bf01584976","volume":"3\u20133","author":"RE Gomory","year":"1972","unstructured":"Gomory, R.E., Johnson, E.L.: Some continuous functions related to corner polyhedra. Math. Program. 3\u20133(1), 23\u201385 (1972). https:\/\/doi.org\/10.1007\/bf01584976","journal-title":"Math. Program."},{"key":"1738_CR30","unstructured":"Inc., W.R.: Mathematica, Version 12.3.1. https:\/\/www.wolfram.com\/mathematica. Champaign, IL (2021)"},{"issue":"2","key":"1738_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":"1738_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."},{"issue":"3","key":"1738_CR33","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"JB Lasserre","year":"2001","unstructured":"Lasserre, J.B.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11(3), 796\u2013817 (2001)","journal-title":"SIAM J. Optim."},{"key":"1738_CR34","doi-asserted-by":"crossref","unstructured":"Laurent, M.: Sums of squares, moment matrices and optimization over polynomials. In: Emerging Applications of Algebraic Geometry, pp. 157\u2013270. Springer (2009)","DOI":"10.1007\/978-0-387-09686-5_7"},{"issue":"1","key":"1738_CR35","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/bf01580665","volume":"10","author":"GP McCormick","year":"1976","unstructured":"McCormick, G.P.: Computability of global solutions to factorable nonconvex programs: part i\u2014convex underestimating problems. Math. Program. 10(1), 147\u2013175 (1976). https:\/\/doi.org\/10.1007\/bf01580665","journal-title":"Math. Program."},{"issue":"1","key":"1738_CR36","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."},{"issue":"1\u20132","key":"1738_CR37","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(1\u20132), 575\u2013611 (2016)","journal-title":"Math. Program."},{"issue":"1","key":"1738_CR38","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1137\/100796947","volume":"25","author":"D Mor\u00e1n","year":"2011","unstructured":"Mor\u00e1n, D., Dey, S.S.: On maximal s-free convex sets. SIAM J. Discrete Math. 25(1), 379\u2013393 (2011). https:\/\/doi.org\/10.1137\/100796947","journal-title":"SIAM J. Discrete Math."},{"key":"1738_CR39","doi-asserted-by":"crossref","unstructured":"Mu\u00f1oz, G., Serrano, F.: Maximal quadratic-free sets. In: International Conference on Integer Programming and Combinatorial Optimization, pp. 307\u2013321. Springer, Cham (2020)","DOI":"10.1007\/978-3-030-45771-6_24"},{"key":"1738_CR40","doi-asserted-by":"crossref","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press (1970)","DOI":"10.1515\/9781400873173"},{"key":"1738_CR41","unstructured":"Santana, A., Dey, S.S.: The convex hull of a quadratic constraint over a polytope. Preprint arXiv:1812.10160 (2018)"},{"key":"1738_CR42","doi-asserted-by":"publisher","unstructured":"Serrano, F.: Intersection cuts for factorable MINLP. In: Integer Programming and Combinatorial Optimization, pp. 385\u2013398. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-17953-3_29","DOI":"10.1007\/978-3-030-17953-3_29"},{"key":"1738_CR43","doi-asserted-by":"crossref","unstructured":"Serrano, F., Schwarz, R., Gleixner, A.: On the relation between the extended supporting hyperplane algorithm and kelley\u2019s cutting plane algorithm. Preprint arXiv:1905.08157 (2019)","DOI":"10.1007\/s10898-020-00906-y"},{"issue":"5","key":"1738_CR44","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1016\/j.orl.2018.07.004","volume":"46","author":"M Shahabsafa","year":"2018","unstructured":"Shahabsafa, M., G\u00f3ez, J.C., Terlaky, T.: On pathological disjunctions and redundant disjunctive conic cuts. Oper. Res. Lett. 46(5), 500\u2013504 (2018)","journal-title":"Oper. Res. Lett."},{"key":"1738_CR45","first-page":"1","volume":"25","author":"NZ Shor","year":"1987","unstructured":"Shor, N.Z.: Quadratic optimization problems. Soviet J. Comput. Syst. Sci. 25, 1\u201311 (1987)","journal-title":"Soviet J. Comput. Syst. Sci."},{"issue":"2","key":"1738_CR46","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1070\/sm1983v046n02abeh002787","volume":"46","author":"VN Solovev","year":"1983","unstructured":"Solovev, V.N.: On a criterion for convexity of a positive-homogeneous function. Math. USSR-Sbornik 46(2), 285\u2013290 (1983). https:\/\/doi.org\/10.1070\/sm1983v046n02abeh002787","journal-title":"Math. USSR-Sbornik"},{"key":"1738_CR47","unstructured":"Towle, E., Luedtke, J.: Intersection disjunctions for reverse convex sets. Preprint arXiv:1901.02112 (2019)"},{"key":"1738_CR48","unstructured":"Tuy, H.: Concave programming with linear constraints. In: Doklady Akademii Nauk, vol. 159, pp. 32\u201335. Russian Academy of Sciences (1964)"},{"key":"1738_CR49","unstructured":"Y\u0131ld\u0131z, S., K\u0131l\u0131n\u00e7-Karzan, F.: Low-complexity relaxations and convex hulls of disjunctions on the positive semidefinite cone and general regular cones. Optimization Online (2016)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-021-01738-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-021-01738-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-021-01738-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,9]],"date-time":"2022-03-09T17:21:30Z","timestamp":1646846490000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-021-01738-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,30]]},"references-count":49,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["1738"],"URL":"https:\/\/doi.org\/10.1007\/s10107-021-01738-8","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2021,11,30]]},"assertion":[{"value":"15 June 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 November 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 November 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}