{"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":1745849442858,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"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_7","type":"book-chapter","created":{"date-parts":[[2023,5,21]],"date-time":"2023-05-21T20:28:43Z","timestamp":1684700923000},"page":"87-99","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Monoidal Strengthening and\u00a0Unique Lifting in\u00a0MIQCPs"],"prefix":"10.1007","author":[{"given":"Antonia","family":"Chmiela","sequence":"first","affiliation":[]},{"given":"Gonzalo","family":"Mu\u00f1oz","sequence":"additional","affiliation":[]},{"given":"Felipe","family":"Serrano","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,22]]},"reference":[{"issue":"1","key":"7_CR1","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)","journal-title":"Oper. Res."},{"issue":"4","key":"7_CR2","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/0377-2217(80)90106-X","volume":"4","author":"E Balas","year":"1980","unstructured":"Balas, E., Jeroslow, R.G.: Strengthening cuts for mixed integer programs. Eur. J. Oper. Res. 4(4), 224\u2013234 (1980)","journal-title":"Eur. J. Oper. Res."},{"issue":"1\u20132","key":"7_CR3","first-page":"561","volume":"141","author":"A Basu","year":"2012","unstructured":"Basu, A., Campelo, M., Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Unique lifting of integer variables in minimal inequalities. Math. Program. 141(1\u20132), 561\u2013576 (2012)","journal-title":"Math. Program."},{"issue":"2","key":"7_CR4","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. Discret. Math. 33(2), 755\u2013783 (2019)","journal-title":"SIAM J. Discret. Math."},{"key":"7_CR5","unstructured":"Bestuzheva, K., et al.: The SCIP Optimization Suite 8.0. ZIB-Report 21\u201341, Zuse Institute Berlin, December 2021"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Bienstock, D., Chen, C., Munoz, 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":"7_CR7","unstructured":"Chmiela, A., Mu\u00f1oz, G., Serrano, F.: Monoidal strengthening and unique lifting in MIQCPs (2022). https:\/\/www.gonzalomunoz.org\/publications\/"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Chmiela, A., Mu\u00f1oz, G., Serrano, F.: On the implementation and strengthening of intersection cuts for QCQPs. Math. Program. pp. 1\u201338 (2022)","DOI":"10.1007\/s10107-022-01808-5"},{"issue":"3","key":"7_CR9","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."},{"issue":"1\u20132","key":"7_CR10","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s10107-010-0362-x","volume":"124","author":"SS Dey","year":"2010","unstructured":"Dey, S.S., Wolsey, L.A.: Two row mixed-integer cuts via lifting. Math. Program. 124(1\u20132), 143\u2013174 (2010)","journal-title":"Math. Program."},{"issue":"2","key":"7_CR11","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s12532-018-0146-5","volume":"11","author":"R Fukasawa","year":"2018","unstructured":"Fukasawa, R., Poirrier, L., Xavier, \u00c1.S.: The (not so) trivial lifting in two dimensions. Math. Program. Comput. 11(2), 211\u2013235 (2018). https:\/\/doi.org\/10.1007\/s12532-018-0146-5","journal-title":"Math. Program. Comput."},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Furini, F., et al.: A library of quadratic programming instances. Programming Computation, QPLIB (2018)","DOI":"10.1007\/s12532-018-0147-4"},{"issue":"1","key":"7_CR13","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)","journal-title":"Oper. Res."},{"key":"7_CR14","unstructured":"MINLP library (2010). http:\/\/www.minlplib.org\/"},{"key":"7_CR15","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":"7_CR16","doi-asserted-by":"crossref","unstructured":"Mu\u00f1oz, G., Serrano, F.: Maximal quadratic-free sets. Math. Program. 1\u201342 (2021)","DOI":"10.1007\/s10107-021-01738-8"},{"key":"7_CR17","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)"},{"issue":"4","key":"7_CR18","doi-asserted-by":"publisher","first-page":"2983","DOI":"10.1137\/19M1277333","volume":"30","author":"A Santana","year":"2020","unstructured":"Santana, A., Dey, S.S.: The convex hull of a quadratic constraint over a polytope. SIAM J. Optim. 30(4), 2983\u20132997 (2020)","journal-title":"SIAM J. Optim."},{"key":"7_CR19","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-031-32726-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,21]],"date-time":"2023-05-21T20:29:16Z","timestamp":1684700956000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-32726-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031327254","9783031327261"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-32726-1_7","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)"}}]}}