{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,28]],"date-time":"2025-04-28T14:10:42Z","timestamp":1745849442799,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031327254"},{"type":"electronic","value":"9783031327261"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-32726-1_24","type":"book-chapter","created":{"date-parts":[[2023,5,21]],"date-time":"2023-05-21T20:28:43Z","timestamp":1684700923000},"page":"334-347","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Towards a Characterization of Maximal Quadratic-Free Sets"],"prefix":"10.1007","author":[{"given":"Gonzalo","family":"Mu\u00f1oz","sequence":"first","affiliation":[]},{"given":"Joseph","family":"Paat","sequence":"additional","affiliation":[]},{"given":"Felipe","family":"Serrano","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,22]]},"reference":[{"key":"24_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-36694-9_4","volume-title":"Integer Programming and Combinatorial Optimization","author":"K Andersen","year":"2013","unstructured":"Andersen, K., Jensen, A.N.: Intersection cuts for mixed integer conic quadratic sets. In: Goemans, M., Correa, J. (eds.) IPCO 2013. LNCS, vol. 7801, pp. 37\u201348. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36694-9_4"},{"key":"24_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"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Averkov, G.: A proof of Lov\u00e1sz\u2019s theorem on maximal lattice-free sets. Contrib. Algebra Geom. (2013)","DOI":"10.1007\/s13366-012-0092-8"},{"issue":"1","key":"24_CR4","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."},{"issue":"3","key":"24_CR5","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. Discret. Math. 27(3), 1610\u20131624 (2013)","journal-title":"SIAM J. Discret. Math."},{"key":"24_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":"24_CR7","doi-asserted-by":"crossref","unstructured":"Balas, E.: Intersection cuts - a new type of cutting planes for integer programming. Oper. Res. (1971)","DOI":"10.1287\/opre.19.1.19"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Barvinok, A.: A course in convexity. Am. Math. Soc. (2002)","DOI":"10.1090\/gsm\/054"},{"issue":"6","key":"24_CR9","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."},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Basu, A., Dey, S., Paat, J.: Nonunique lifting of integer variables in minimal inequalities. SIAM J. Discret. Math. (2019)","DOI":"10.1137\/17M1117070"},{"issue":"3","key":"24_CR11","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":"24_CR12","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. Discret. Math. 24(1), 158\u2013168 (2010)","journal-title":"SIAM J. Discret. Math."},{"key":"24_CR13","series-title":"Lecture Notes in Computer Science","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.) IPCO 2019. LNCS, vol. 11480, pp. 72\u201387. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17953-3_6"},{"key":"24_CR14","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. 183, 105\u2013148 (2020)","DOI":"10.1007\/s10107-020-01484-3"},{"key":"24_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":"24_CR16","doi-asserted-by":"crossref","unstructured":"Conforti, M., Cornu\u00e9jols, G., Daniilidis, A., Lemar\u00e9chal, C., Malick, J.: Cut-generating functions and S-free sets. Math. Oper. Res. (2014)","DOI":"10.1007\/978-3-642-36694-9_11"},{"issue":"3","key":"24_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":"24_CR18","doi-asserted-by":"publisher","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Integer Programming. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11008-0","DOI":"10.1007\/978-3-319-11008-0"},{"issue":"4","key":"24_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. Discret. Math. 30(4), 2206\u20132216 (2016)","journal-title":"SIAM J. Discret. Math."},{"key":"24_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":"24_CR21","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, Amsterdam (1989)"},{"key":"24_CR22","doi-asserted-by":"crossref","unstructured":"Modaresi, S., K\u0131l\u0131n\u00e7, M., Vielma, J.: Intersection cuts for nonlinear integer programming convexification techniques for structured sets. Math. Program. (2016)","DOI":"10.1007\/s10107-015-0866-5"},{"key":"24_CR23","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":"24_CR24","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":"24_CR25","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":"24_CR26","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"key":"24_CR27","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":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-32726-1_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,21]],"date-time":"2023-05-21T20:30:56Z","timestamp":1684701056000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-32726-1_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031327254","9783031327261"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-32726-1_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"22 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madison, WI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/optimization.discovery.wisc.edu\/ipco-2023-madison\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"119","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}