{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T05:39:20Z","timestamp":1740807560042,"version":"3.38.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2024,5,23]],"date-time":"2024-05-23T00:00:00Z","timestamp":1716422400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,23]],"date-time":"2024-05-23T00:00:00Z","timestamp":1716422400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["RGPIN-2021-02475"],"award-info":[{"award-number":["RGPIN-2021-02475"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Research and Development Agency of Chile","award":["Fondecyt Grant 1231522"],"award-info":[{"award-number":["Fondecyt Grant 1231522"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s10107-024-02092-1","type":"journal-article","created":{"date-parts":[[2024,5,23]],"date-time":"2024-05-23T13:01:49Z","timestamp":1716469309000},"page":"641-668","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A characterization of maximal homogeneous-quadratic-free sets"],"prefix":"10.1007","volume":"210","author":[{"given":"Gonzalo","family":"Mu\u00f1oz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2930-3155","authenticated-orcid":false,"given":"Joseph","family":"Paat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Felipe","family":"Serrano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,5,23]]},"reference":[{"key":"2092_CR1","doi-asserted-by":"crossref","unstructured":"Andersen, K., Jensen, A.: Intersection cuts for mixed integer conic quadratic sets. In: Integer Programming and Combinatorial Optimization, pp. 37\u201348. Springer, Berlin (2013)","DOI":"10.1007\/978-3-642-36694-9_4"},{"key":"2092_CR2","doi-asserted-by":"crossref","unstructured":"Andersen, K., Louveaux, Q., Weismantel, R., Wolsey, L.: Cutting planes from two rows of the simplex tableau. In: Proceedings of Integer Programming and Combinatorial Optimization (IPCO), pp. 1\u201315 (2007)","DOI":"10.1007\/978-3-540-72792-7_1"},{"issue":"3","key":"2092_CR3","doi-asserted-by":"publisher","first-page":"1610","DOI":"10.1137\/110850463","volume":"27","author":"G Averkov","year":"2013","unstructured":"Averkov, G.: On maximal s-free sets and the Helly number for the family of s-convex sets. SIAM J. Discrete Math. 27(3), 1610\u20131624 (2013)","journal-title":"SIAM J. Discrete Math."},{"key":"2092_CR4","doi-asserted-by":"crossref","unstructured":"Averkov, G.: A proof of Lov\u00e1sz\u2019s theorem on maximal lattice-free sets. Contributions to Algebra and Geometry (2013)","DOI":"10.1007\/s13366-012-0092-8"},{"issue":"1","key":"2092_CR5","doi-asserted-by":"publisher","first-page":"904","DOI":"10.1137\/17M1128939","volume":"28","author":"G Averkov","year":"2018","unstructured":"Averkov, G., Basu, A., Paat, J.: Approximation of corner polyhedra with families of intersection cuts. SIAM J. Optim. 28(1), 904\u2013929 (2018)","journal-title":"SIAM J. Optim."},{"key":"2092_CR6","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/s10107-015-0917-y","volume":"158","author":"M Baes","year":"2016","unstructured":"Baes, M., Oertel, T., Weismantel, R.: Duality for mixed-integer convex minimization. Math. Program. 158, 547\u2013564 (2016)","journal-title":"Math. Program."},{"key":"2092_CR7","doi-asserted-by":"crossref","unstructured":"Balas, E.: Intersection cuts - a new type of cutting planes for integer programming. Operations Research (1971)","DOI":"10.1287\/opre.19.1.19"},{"issue":"6","key":"2092_CR8","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1016\/j.orl.2017.10.002","volume":"45","author":"A Basu","year":"2017","unstructured":"Basu, A., Conforti, M., Cornu\u00e9jols, G., Weismantel, R., Weltge, S.: Optimality certificates for convex minimization and Helly numbers. Oper. Res. Lett. 45(6), 671\u2013674 (2017)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"2092_CR9","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)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"2092_CR10","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."},{"key":"2092_CR11","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1137\/17M1117070","volume":"33","author":"A Basu","year":"2019","unstructured":"Basu, A., Dey, S., Paat, J.: Nonunique lifting of integer variables in minimal inequalities. SIAM J. Discrete Math. 33, 755\u2013783 (2019)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"2092_CR12","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1287\/moor.2014.0665","volume":"40","author":"A Basu","year":"2015","unstructured":"Basu, A., Martin, K., Ryan, C.T.: Projection: a unified approach to semi-infinite linear programs and duality in convex programming. Math. Oper. Res. 40(1), 146\u2013170 (2015)","journal-title":"Math. Oper. Res."},{"key":"2092_CR13","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-030-17953-3_6","volume-title":"Integer Programming and Combinatorial Optimization","author":"D Bienstock","year":"2019","unstructured":"Bienstock, D., Chen, C., Mu\u00f1oz, G.: Intersection cuts for polynomial optimization. In: Lodi, A., Nagarajan, V. (eds.) Integer Programming and Combinatorial Optimization, pp. 72\u201387. Springer, Cham (2019)"},{"key":"2092_CR14","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s10107-020-01484-3","volume":"183","author":"D Bienstock","year":"2020","unstructured":"Bienstock, D., Chen, C., Mu\u00f1oz, G.: Outer-product-free sets for polynomial optimization and oracle-based cuts. Math. Program. 183, 105\u2013148 (2020)","journal-title":"Math. Program."},{"key":"2092_CR15","doi-asserted-by":"crossref","unstructured":"Chmiela, A., Mu\u00f1oz, G., Serrano, F.: On the implementation and strengthening of intersection cuts for QCQPs. Math. Program. 1\u201338 (2022)","DOI":"10.1007\/s10107-022-01808-5"},{"key":"2092_CR16","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1287\/moor.2014.0670","volume":"40","author":"M Conforti","year":"2014","unstructured":"Conforti, M., Cornu\u00e9jols, G., Daniilidis, A., Lemar\u00e9chal, C., Malick, J.: Cut-generating functions and S-free sets. Math. Oper. Res. 40, 276 (2014)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"2092_CR17","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1287\/opre.1110.0916","volume":"59","author":"M Conforti","year":"2011","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: A geometric perspective on lifting. Oper. Res. 59(3), 569\u2013577 (2011)","journal-title":"Oper. Res."},{"key":"2092_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11008-0","volume-title":"Integer Programming","author":"M Conforti","year":"2014","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Integer Programming. Springer, Berlin (2014)"},{"issue":"4","key":"2092_CR19","doi-asserted-by":"publisher","first-page":"2206","DOI":"10.1137\/16M1063484","volume":"30","author":"M Conforti","year":"2016","unstructured":"Conforti, M., Summa, M.D.: Maximal s-free convex sets and the Helly number. SIAM J. Discrete Math. 30(4), 2206\u20132216 (2016)","journal-title":"SIAM J. Discrete Math."},{"key":"2092_CR20","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s10107-010-0362-x","volume":"124","author":"S Dey","year":"2010","unstructured":"Dey, S., Wolsey, L.: Two row mixed-integer cuts via lifting. Math. Program. 124, 143\u2013174 (2010)","journal-title":"Math. Program."},{"key":"2092_CR21","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01442122","volume":"7","author":"M Goberna","year":"1981","unstructured":"Goberna, M., L\u00f3pez, M., Pastor, J.: Farkas-Minkowski systems in semi-infinite programming. Appl. Math. Optim. 7, 295\u2013308 (1981)","journal-title":"Appl. Math. Optim."},{"key":"2092_CR22","volume-title":"Linear Semi-infinite Optimization","author":"MA Goberna","year":"1998","unstructured":"Goberna, M.A., Lopez-Cerda, M.: Linear Semi-infinite Optimization. Wiley, Chichester (1998)"},{"key":"2092_CR23","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\u2013201. Kluwer Academic Publishers, Boston (1989)"},{"key":"2092_CR24","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., Vielma, J.: Intersection cuts for nonlinear integer programming convexification techniques for structured sets. Math. Program. 155, 575\u2013611 (2016)","journal-title":"Math. Program."},{"key":"2092_CR25","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-031-32726-1_24","volume-title":"Integer Programming and Combinatorial Optimization","author":"G Mu\u00f1oz","year":"2023","unstructured":"Mu\u00f1oz, G., Paat, J., Serrano, F.: Towards a characterization of maximal quadratic-free sets. In: Del Pia, A., Kaibel, V. (eds.) Integer Programming and Combinatorial Optimization, pp. 334\u2013347. Springer International Publishing, Cham (2023)"},{"key":"2092_CR26","doi-asserted-by":"crossref","unstructured":"Mu\u00f1oz, G., Serrano, F.: Maximal quadratic-free sets. In: Proceedings of the International Conference on Integer Programming and Combinatorial Optimization, pp. 307\u2013321 (2020)","DOI":"10.1007\/978-3-030-45771-6_24"},{"key":"2092_CR27","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s10107-021-01738-8","volume":"192","author":"G Mu\u00f1oz","year":"2022","unstructured":"Mu\u00f1oz, G., Serrano, F.: Maximal quadratic-free sets. Math. Program. 192, 229\u2013270 (2022)","journal-title":"Math. Program."},{"issue":"1","key":"2092_CR28","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s10107-021-01658-7","volume":"192","author":"J Paat","year":"2022","unstructured":"Paat, J., Schl\u00f6ter, M., Speakman, E.: Constructing lattice-free gradient polyhedra in dimension two. Math. Program. 192(1), 293\u2013317 (2022)","journal-title":"Math. Program."},{"key":"2092_CR29","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"key":"2092_CR30","first-page":"32","volume":"159","author":"H Tuy","year":"1964","unstructured":"Tuy, H.: Concave minimization under linear constraints with special structure. Dokl. Akad. Nauk SSSR 159, 32\u201335 (1964)","journal-title":"Dokl. Akad. Nauk SSSR"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-024-02092-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-024-02092-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-024-02092-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T15:49:19Z","timestamp":1740757759000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-024-02092-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,23]]},"references-count":30,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["2092"],"URL":"https:\/\/doi.org\/10.1007\/s10107-024-02092-1","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2024,5,23]]},"assertion":[{"value":"31 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 April 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 May 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose. The authors have no conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}