{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T05:39:41Z","timestamp":1740807581970,"version":"3.38.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T00:00:00Z","timestamp":1720396800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T00:00:00Z","timestamp":1720396800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100020884","name":"Agencia Nacional de Investigaci\u00f3n y Desarrollo","doi-asserted-by":"publisher","award":["1231522","PIA\/PUENTE AFB230002"],"award-info":[{"award-number":["1231522","PIA\/PUENTE AFB230002"]}],"id":[{"id":"10.13039\/501100020884","id-type":"DOI","asserted-by":"publisher"}]}],"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-02112-0","type":"journal-article","created":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T16:02:34Z","timestamp":1720454554000},"page":"189-222","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Monoidal strengthening and unique lifting in MIQCPs"],"prefix":"10.1007","volume":"210","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":[[2024,7,8]]},"reference":[{"issue":"1","key":"2112_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\u2014a new type of cutting planes for integer programming. Oper. Res. 19(1), 19\u201339 (1971)","journal-title":"Oper. Res."},{"issue":"4","key":"2112_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":"2112_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":"2112_CR4","first-page":"427","volume":"18","author":"A Basu","year":"2011","unstructured":"Basu, A., Cornu\u00e9jols, G., Zambelli, G.: Convex sets and minimal sublinear functions. J. Convex Anal. 18(2), 427\u2013432 (2011)","journal-title":"J. Convex Anal."},{"issue":"2","key":"2112_CR5","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)","journal-title":"SIAM J. Discrete Math."},{"key":"2112_CR6","unstructured":"Bestuzheva, K., Besan\u00e7on, M., Chen, W.-K., Chmiela, A., Donkiewicz, T., van Doornmalen, J., Eifler, L., Gaul, O., Gamrath, G., Gleixner, A., Gottwald, L., Graczyk, C., Halbig, K., Hoen, A., Hojny, C., van der Hulst, R., Koch, T., L\u00fcbbecke, M., Maher, S.J., Matter, F., M\u00fchmer, E., M\u00fcller, B., Pfetsch, M.E., Rehfeldt, D., Schlein, S., Schl\u00f6sser, F., Serrano, F., Shinano, Y., Sofranac, B., Turner, M., Vigerske, S., Wegscheider, F., Wellner, P., Weninger, D., Witzig, J.: The SCIP Optimization Suite 8.0. ZIB-Report 21-41, Zuse Institute Berlin (2021)"},{"key":"2112_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-020-01484-3","volume":"183","author":"D Bienstock","year":"2020","unstructured":"Bienstock, D., Chen, C., Munoz, G.: Outer-product-free sets for polynomial optimization and oracle-based cuts. Math. Program. 183, 1\u201344 (2020)","journal-title":"Math. Program."},{"key":"2112_CR8","first-page":"1","volume":"197","author":"A Chmiela","year":"2022","unstructured":"Chmiela, A., Mu\u00f1oz, G., Serrano, F.: On the implementation and strengthening of intersection cuts for QCQPs. Math. Program. 197, 1\u201338 (2022)","journal-title":"Math. Program."},{"key":"2112_CR9","doi-asserted-by":"crossref","unstructured":"Chmiela, A., Mu\u00f1oz, G., Serrano, F.: Monoidal strengthening and unique lifting in MIQCPs. In: Integer Programming and Combinatorial Optimization: 24th International Conference, IPCO 2023, Madison, WI, USA, June 21\u201323, 2023, Proceedings, pp. 87\u201399. Springer, Cham (2023)","DOI":"10.1007\/978-3-031-32726-1_7"},{"issue":"2","key":"2112_CR10","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)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"2112_CR11","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":"6","key":"2112_CR12","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)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"2112_CR13","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":"2112_CR14","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)","journal-title":"Math. Program. Comput."},{"key":"2112_CR15","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s12532-018-0147-4","volume":"11","author":"F Furini","year":"2018","unstructured":"Furini, F., Traversi, E., Belotti, P., Frangioni, A., Gleixner, A., Gould, N., Liberti, L., Lodi, A., Misener, R., Mittelmann, H., Sahinidis, N.V.: QPLIB: a library of quadratic programming instances. Program. Comput. 11, 237\u2013265 (2018)","journal-title":"Program. Comput."},{"issue":"1","key":"2112_CR16","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":"2112_CR17","unstructured":"Gomory, R.: An algorithm for the mixed integer problem. Technical report, RAND CORP SANTA MONICA CA (1960)"},{"key":"2112_CR18","unstructured":"MINLP library (2010). http:\/\/www.minlplib.org\/"},{"key":"2112_CR19","first-page":"1","volume":"192","author":"G Mu\u00f1oz","year":"2021","unstructured":"Mu\u00f1oz, G., Serrano, F.: Maximal quadratic-free sets. Math. Program. 192, 1\u201342 (2021)","journal-title":"Math. Program."},{"key":"2112_CR20","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":"2112_CR21","unstructured":"Tuy, H.: Concave programming with linear constraints. In: Doklady Akademii Nauk, vol. 159, pp. 32\u201335. Russian Academy of Sciences (1964)"},{"issue":"2","key":"2112_CR22","first-page":"307","volume":"20","author":"A Zaffaroni","year":"2013","unstructured":"Zaffaroni, A.: Convex radiant costarshaped sets and the least sublinear gauge. J. Convex Anal. 20(2), 307\u2013328 (2013)","journal-title":"J. Convex Anal."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-024-02112-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-024-02112-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-024-02112-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T15:59:42Z","timestamp":1740758382000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-024-02112-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,8]]},"references-count":22,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["2112"],"URL":"https:\/\/doi.org\/10.1007\/s10107-024-02112-0","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2024,7,8]]},"assertion":[{"value":"31 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 June 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 July 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 declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}