{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:32:04Z","timestamp":1742913124313,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030738785"},{"type":"electronic","value":"9783030738792"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-73879-2_10","type":"book-chapter","created":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T23:04:59Z","timestamp":1620169499000},"page":"134-147","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the Implementation and Strengthening of Intersection Cuts for QCQPs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4809-2958","authenticated-orcid":false,"given":"Antonia","family":"Chmiela","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9003-441X","authenticated-orcid":false,"given":"Gonzalo","family":"Mu\u00f1oz","sequence":"additional","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,5,5]]},"reference":[{"key":"10_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"},{"issue":"1","key":"10_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":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-72792-7_1","volume-title":"Integer Programming and Combinatorial Optimization","author":"K Andersen","year":"2007","unstructured":"Andersen, K., Louveaux, Q., Weismantel, R., Wolsey, L.A.: Inequalities from two rows of a simplex tableau. In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol. 4513, pp. 1\u201315. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72792-7_1"},{"issue":"1","key":"10_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":"10_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":"10_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."},{"key":"10_CR7","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":"10_CR8","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., Gonzalo, M., et al.: Outer-product-free sets for polynomial optimization and oracle-based cuts. Math. Program. 183, 105\u2013148 (2020). https:\/\/doi.org\/10.1007\/s10107-020-01484-3","journal-title":"Math. Program."},{"key":"10_CR9","unstructured":"Bonami, P., Linderoth, J., Lodi, A.: Disjunctive cuts for mixed integer nonlinear programming problems. Prog. Comb. Optim., 521\u2013541 (2011)"},{"issue":"3","key":"10_CR10","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":"10_CR11","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/s10107-016-1045-z","volume":"162","author":"S Burer","year":"2016","unstructured":"Burer, S., Fatma, K.K.: How to convexify the intersection of a second order cone and a nonconvex quadratic. Math. Program. 162, 393\u2013429 (2016). https:\/\/doi.org\/10.1007\/s10107-016-1045-z","journal-title":"Math. Program."},{"key":"10_CR12","unstructured":"Chmiela, A., Mu\u00f1oz, G., Serrano, F.: On the implementation and strengthening of intersection cuts for QCQPs. Online preprint (2020). https:\/\/opus4.kobv.de\/opus4-zib\/frontdoor\/index\/index\/docId\/7999"},{"issue":"2","key":"10_CR13","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":"1","key":"10_CR14","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/s10107-014-0780-2","volume":"152","author":"G Cornu\u00e9jols","year":"2014","unstructured":"Cornu\u00e9jols, G., Wolsey, L., Y\u0131ld\u0131z, S.: Sufficiency of cut-generating functions. Math. Program. 152(1), 643\u2013651 (2014). https:\/\/doi.org\/10.1007\/s10107-014-0780-2","journal-title":"Math. Program."},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-540-68891-4_32","volume-title":"Integer Programming and Combinatorial Optimization","author":"SS Dey","year":"2008","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.) IPCO 2008. LNCS, vol. 5035, pp. 463\u2013475. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68891-4_32"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-319-33461-5_7","volume-title":"Integer Programming and Combinatorial Optimization","author":"M Fischetti","year":"2016","unstructured":"Fischetti, M., Ljubi\u0107, I., Monaci, M., Sinnl, M.: Intersection cuts for bilevel optimization. In: Louveaux, Q., Skutella, M. (eds.) IPCO 2016. LNCS, vol. 9682, pp. 77\u201388. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-33461-5_7"},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1016\/j.ejor.2019.09.043","volume":"282","author":"M Fischetti","year":"2019","unstructured":"Fischetti, M., Monaci, M.: A branch-and-cut algorithm for mixed-integer bilinear programming. Eur. J. Oper. Res. 282, 506\u2013514 (2019). https:\/\/doi.org\/10.1016\/j.ejor.2019.09.043","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"10_CR18","first-page":"181","volume":"18","author":"F Glover","year":"1974","unstructured":"Glover, F.: Polyhedral convexity cuts and negative edge extensions. Zeitschrift f\u00fcr Oper. Res. 18(5), 181\u2013186 (1974)","journal-title":"Zeitschrift f\u00fcr Oper. Res."},{"issue":"1","key":"10_CR19","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":"10_CR20","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(1), 23\u201385 (1972). https:\/\/doi.org\/10.1007\/bf01584976","journal-title":"Math. Program."},{"issue":"2","key":"10_CR21","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","key":"10_CR22","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 \u2013 convex underestimating problems. Math. Program. 10(1), 147\u2013175 (1976). https:\/\/doi.org\/10.1007\/bf01580665","journal-title":"Math. Program."},{"key":"10_CR23","unstructured":"MINLP library. http:\/\/www.minlplib.org\/"},{"issue":"1","key":"10_CR24","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":"10_CR25","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."},{"key":"10_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-030-45771-6_24","volume-title":"Integer Programming and Combinatorial Optimization","author":"G Mu\u00f1oz","year":"2020","unstructured":"Mu\u00f1oz, G., Serrano, F.: Maximal quadratic-free sets. In: Bienstock, D., Zambelli, G. (eds.) IPCO 2020. LNCS, vol. 12125, pp. 307\u2013321. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45771-6_24"},{"key":"10_CR27","unstructured":"Santana, A., Dey, S.S.: The convex hull of a quadratic constraint over a polytope. arXiv preprint arXiv:1812.10160 (2018)"},{"key":"10_CR28","unstructured":"SCIP - Solving Constraint Integer Programs. http:\/\/scip.zib.de"},{"issue":"1","key":"10_CR29","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/bf01582164","volume":"34","author":"S Sen","year":"1986","unstructured":"Sen, S., Sherali, H.D.: Facet inequalities from simple disjunctions in cutting plane theory. Math. Program. 34(1), 72\u201383 (1986). https:\/\/doi.org\/10.1007\/bf01582164","journal-title":"Math. Program."},{"issue":"2","key":"10_CR30","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02591693","volume":"37","author":"S Sen","year":"1987","unstructured":"Sen, S., Sherali, H.D.: Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization. Math. Program. 37(2), 169\u2013183 (1987)","journal-title":"Math. Program."},{"key":"10_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-030-17953-3_29","volume-title":"Integer Programming and Combinatorial Optimization","author":"F Serrano","year":"2019","unstructured":"Serrano, F.: Intersection cuts for factorable MINLP. In: Lodi, A., Nagarajan, V. (eds.) IPCO 2019. LNCS, vol. 11480, pp. 385\u2013398. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17953-3_29"},{"key":"10_CR32","unstructured":"Towle, E., Luedtke, J.: Intersection disjunctions for reverse convex sets. arXiv preprint arXiv:1901.02112 (2019)"},{"key":"10_CR33","unstructured":"Tuy, H.: Concave programming with linear constraints. In: Doklady Akademii Nauk, vol. 159, pp. 32\u201335. Russian Academy of Sciences (1964)"}],"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-030-73879-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T23:06:50Z","timestamp":1620169610000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-73879-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030738785","9783030738792"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-73879-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"5 May 2021","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":"Atlanta, GA","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.gatech.edu\/ipco-2021\/","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":"90","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":"37% - 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":"15","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)"}},{"value":"Due to the COVID-19 pandemic the conference took place virtually","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}