{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,28]],"date-time":"2025-04-28T14:10:14Z","timestamp":1745849414176,"version":"3.37.3"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,4,18]],"date-time":"2022-04-18T00:00:00Z","timestamp":1650240000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,4,18]],"date-time":"2022-04-18T00:00:00Z","timestamp":1650240000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100002848","name":"Comision Nacional de Investigacion Cientifica y Tecnologica","doi-asserted-by":"publisher","award":["11190515"],"award-info":[{"award-number":["11190515"]}],"id":[{"id":"10.13039\/501100002848","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002347","name":"Bundesministerium fur Bildung und Forschung","doi-asserted-by":"publisher","award":["05M14ZAM","05M14ZAM"],"award-info":[{"award-number":["05M14ZAM","05M14ZAM"]}],"id":[{"id":"10.13039\/501100002347","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002347","name":"Bundesministerium fur Bildung und Forschung","doi-asserted-by":"publisher","award":["05M20ZBM","05M20ZBM"],"award-info":[{"award-number":["05M20ZBM","05M20ZBM"]}],"id":[{"id":"10.13039\/501100002347","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003161","name":"Forschungskuratorium Textil, Bundesministerium fur Wirtschaft und Energie","doi-asserted-by":"publisher","award":["EnBA-M (ID: 03ET1549D)"],"award-info":[{"award-number":["EnBA-M (ID: 03ET1549D)"]}],"id":[{"id":"10.13039\/501100003161","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2023,2]]},"DOI":"10.1007\/s10107-022-01808-5","type":"journal-article","created":{"date-parts":[[2022,4,18]],"date-time":"2022-04-18T13:03:25Z","timestamp":1650287005000},"page":"549-586","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["On the implementation and strengthening of intersection cuts for QCQPs"],"prefix":"10.1007","volume":"197","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":[[2022,4,18]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Achterberg, T.: Constraint integer programming. Doctoral thesis, Technische Universit\u00e4t Berlin, Fakult\u00e4t II\u2014Mathematik und Naturwissenschaften, Berlin (2007). https:\/\/doi.org\/10.14279\/depositonce-1634","key":"1808_CR1","DOI":"10.14279\/depositonce-1634"},{"key":"1808_CR2","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.) Integer Programming and Combinatorial Optimization, pp. 37\u201348. Springer, New York (2013)"},{"issue":"1","key":"1808_CR3","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."},{"doi-asserted-by":"publisher","unstructured":"Andersen, K., Louveaux, Q., Weismantel, R., Wolsey, L.A.: Inequalities from two rows of a simplex tableau. In: Integer Programming and Combinatorial Optimization, pp. 1\u201315. Springer, Berlin (2007). https:\/\/doi.org\/10.1007\/978-3-540-72792-7_1","key":"1808_CR4","DOI":"10.1007\/978-3-540-72792-7_1"},{"issue":"1","key":"1808_CR5","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). https:\/\/doi.org\/10.1287\/opre.19.1.19","journal-title":"Oper. Res."},{"issue":"3","key":"1808_CR6","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":"1808_CR7","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."},{"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\u00a0der 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). http:\/\/nbn-resolving.de\/urn:nbn:de:0297-zib-85309","key":"1808_CR8"},{"doi-asserted-by":"publisher","unstructured":"Bienstock, D., Chen, C., Mu\u00f1oz, G.: Intersection cuts for polynomial optimization. In: Integer Programming and Combinatorial Optimization, pp. 72\u201387. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-17953-3_6","key":"1808_CR9","DOI":"10.1007\/978-3-030-17953-3_6"},{"doi-asserted-by":"crossref","unstructured":"Bienstock, D., Chen, C., Munoz, G.: Outer-product-free sets for polynomial optimization and oracle-based cuts. Math. Program. 183, 105\u2013148 (2020)","key":"1808_CR10","DOI":"10.1007\/s10107-020-01484-3"},{"unstructured":"Bonami, P., Linderoth, J., Lodi, A.: Disjunctive cuts for mixed integer nonlinear programming problems. In: Majoub, R. (ed.) Progress in Combinatorial Optimization, pp. 521\u2013544. Wiley\/ISTE, New York (2011)","key":"1808_CR11"},{"issue":"3","key":"1808_CR12","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."},{"issue":"1\u20132","key":"1808_CR13","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/s10107-016-1045-z","volume":"162","author":"S Burer","year":"2017","unstructured":"Burer, S., K\u0131l\u0131n\u00e7-Karzan, F.: How to convexify the intersection of a second order cone and a nonconvex quadratic. Math. Program. 162(1\u20132), 393\u2013429 (2017)","journal-title":"Math. Program."},{"doi-asserted-by":"crossref","unstructured":"Chmiela, A., Mu\u00f1oz, G., Serrano, F.: On the implementation and strengthening of intersection cuts for QCQPs. In: International Conference on Integer Programming and Combinatorial Optimization. Springer, Cham (2021)","key":"1808_CR14","DOI":"10.1007\/s10107-022-01808-5"},{"issue":"2","key":"1808_CR15","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":"2","key":"1808_CR16","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.sorms.2011.03.001","volume":"16","author":"M Conforti","year":"2011","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Corner polyhedron and intersection cuts. Surv. Oper. Res. Manag. Sci. 16(2), 105\u2013120 (2011). https:\/\/doi.org\/10.1016\/j.sorms.2011.03.001","journal-title":"Surv. Oper. Res. Manag. Sci."},{"key":"1808_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11008-0","volume-title":"Integer Programming","author":"M Conforti","year":"2014","unstructured":"Conforti, M., Cornuejols, G., Zambelli, G.: Integer Programming. Springer, New York (2014)"},{"issue":"1\u20132","key":"1808_CR18","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/s10107-014-0780-2","volume":"152","author":"G Cornu\u00e9jols","year":"2015","unstructured":"Cornu\u00e9jols, G., Wolsey, L., Y\u0131ld\u0131z, S.: Sufficiency of cut-generating functions. Math. Program. 152(1\u20132), 643\u2013651 (2015)","journal-title":"Math. Program."},{"key":"1808_CR19","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.) Integer Programming and Combinatorial Optimization, pp. 463\u2013475. Springer, New York (2008)"},{"issue":"6","key":"1808_CR20","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). https:\/\/doi.org\/10.1137\/090754388","journal-title":"SIAM J. Optim."},{"doi-asserted-by":"publisher","unstructured":"Fischetti, M., Ljubi\u0107, I., Monaci, M., Sinnl, M.: Intersection cuts for bilevel optimization. In: Integer Programming and Combinatorial Optimization, pp. 77\u201388. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-319-33461-5_7","key":"1808_CR21","DOI":"10.1007\/978-3-319-33461-5_7"},{"key":"1808_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2019.09.043","author":"M Fischetti","year":"2019","unstructured":"Fischetti, M., Monaci, M.: A branch-and-cut algorithm for mixed-integer bilinear programming. Eur. J. Oper. Res. (2019). https:\/\/doi.org\/10.1016\/j.ejor.2019.09.043","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"1808_CR23","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF01582241","volume":"33","author":"RM Freund","year":"1985","unstructured":"Freund, R.M., Orlin, J.B.: On the complexity of four polyhedral set containment problems. Math. Program. 33(2), 139\u2013145 (1985)","journal-title":"Math. Program."},{"issue":"1","key":"1808_CR24","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":"5","key":"1808_CR25","first-page":"181","volume":"18","author":"F Glover","year":"1974","unstructured":"Glover, F.: Polyhedral convexity cuts and negative edge extensions. Z. Oper. Res. 18(5), 181\u2013186 (1974)","journal-title":"Z. Oper. Res."},{"issue":"1","key":"1808_CR26","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/bf01584976","volume":"3\u20133","author":"RE Gomory","year":"1972","unstructured":"Gomory, R.E., Johnson, E.L.: Some continuous functions related to corner polyhedra. Math. Program. 3\u20133(1), 23\u201385 (1972). https:\/\/doi.org\/10.1007\/bf01584976","journal-title":"Math. Program."},{"key":"1808_CR27","volume-title":"Global Optimization: Deterministic Approaches","author":"R Horst","year":"2013","unstructured":"Horst, R., Tuy, H.: Global Optimization: Deterministic Approaches. Springer, New York (2013)"},{"issue":"2","key":"1808_CR28","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":"1808_CR29","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\u2014convex underestimating problems. Math. Program. 10(1), 147\u2013175 (1976). https:\/\/doi.org\/10.1007\/bf01580665","journal-title":"Math. Program."},{"unstructured":"MINLP library. http:\/\/www.minlplib.org\/","key":"1808_CR30"},{"issue":"1","key":"1808_CR31","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":"1808_CR32","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."},{"doi-asserted-by":"crossref","unstructured":"Mu\u00f1oz, G., Serrano, F.: Maximal quadratic-free sets. Math. Program. 192, 229\u2013270 (2022)","key":"1808_CR33","DOI":"10.1007\/s10107-021-01738-8"},{"unstructured":"Santana, A., Dey, S.S.: The convex hull of a quadratic constraint over a polytope. arXiv preprint arXiv:1812.10160 (2018)","key":"1808_CR34"},{"issue":"1","key":"1808_CR35","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":"1808_CR36","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."},{"doi-asserted-by":"publisher","unstructured":"Serrano, F.: Intersection cuts for factorable MINLP. In: Integer Programming and Combinatorial Optimization, pp. 385\u2013398. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-17953-3_29","key":"1808_CR37","DOI":"10.1007\/978-3-030-17953-3_29"},{"key":"1808_CR38","volume-title":"Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications","author":"M Tawarmalani","year":"2013","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications, vol. 65. Springer, New York (2013)"},{"unstructured":"Towle, E., Luedtke, J.: Intersection disjunctions for reverse convex sets. arXiv preprint arXiv:1901.02112 (2019)","key":"1808_CR39"},{"unstructured":"Tuy, H.: Concave programming with linear constraints. In: Doklady Akademii Nauk, vol. 159, pp. 32\u201335. Russian Academy of Sciences (1964)","key":"1808_CR40"},{"issue":"3","key":"1808_CR41","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1080\/10556788.2017.1335312","volume":"33","author":"S Vigerske","year":"2018","unstructured":"Vigerske, S., Gleixner, A.: SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework. Optim. Methods Softw. 33(3), 563\u2013593 (2018)","journal-title":"Optim. Methods Softw."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01808-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-022-01808-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-022-01808-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,6]],"date-time":"2023-02-06T17:19:23Z","timestamp":1675703963000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-022-01808-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,18]]},"references-count":41,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["1808"],"URL":"https:\/\/doi.org\/10.1007\/s10107-022-01808-5","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2022,4,18]]},"assertion":[{"value":"31 May 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 March 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 April 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}