{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T04:04:13Z","timestamp":1745899453863,"version":"3.40.4"},"reference-count":91,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2024,2,19]],"date-time":"2024-02-19T00:00:00Z","timestamp":1708300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,2,19]],"date-time":"2024-02-19T00:00:00Z","timestamp":1708300800000},"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":["Math. Program."],"published-print":{"date-parts":[[2025,5]]},"DOI":"10.1007\/s10107-024-02059-2","type":"journal-article","created":{"date-parts":[[2024,2,19]],"date-time":"2024-02-19T13:02:20Z","timestamp":1708347740000},"page":"341-377","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Submodular maximization and its generalization through an intersection cut lens"],"prefix":"10.1007","volume":"211","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0286-1109","authenticated-orcid":false,"given":"Liding","family":"Xu","sequence":"first","affiliation":[]},{"given":"Leo","family":"Liberti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,19]]},"reference":[{"unstructured":"SCIP Doxygen Documentation: examples\/GMI\/src\/sepa_gmi.c Source File (2023). https:\/\/scipopt.org\/doc-8.0.3\/html\/sepa__gmi_8c_source.php. [Online; accessed 11. Jul. 2023]","key":"2059_CR1"},{"unstructured":"SCIP Doxygen Documentation: How to add separators (2023). https:\/\/www.scipopt.org\/doc-8.0.3\/html\/SEPA.php. [Online; accessed 6. Jul. 2023]","key":"2059_CR2"},{"unstructured":"SCIP Doxygen Documentation: nlhdlr_quadratic.c Source File (2023). https:\/\/www.scipopt.org\/doc-8.0.3\/html\/nlhdlr__quadratic_8c_source.php. [Online; accessed 14. Jul. 2023]","key":"2059_CR3"},{"issue":"10","key":"2059_CR4","doi-asserted-by":"crossref","first-page":"1274","DOI":"10.1287\/mnsc.32.10.1274","volume":"32","author":"WP Adams","year":"1986","unstructured":"Adams, W.P., Sherali, H.D.: A tight linearization and an algorithm for zero-one quadratic programming problems. Manage. Sci. 32(10), 1274\u20131290 (1986)","journal-title":"Manage. Sci."},{"issue":"1","key":"2059_CR5","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/s10107-009-0298-1","volume":"128","author":"S Ahmed","year":"2011","unstructured":"Ahmed, S., Atamt\u00fcrk, A.: Maximizing a class of submodular utility functions. Math. Program. 128(1), 149\u2013169 (2011)","journal-title":"Math. Program."},{"issue":"1","key":"2059_CR6","doi-asserted-by":"crossref","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":"2059_CR7","first-page":"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.) Integer Programming and Combinatorial Optimization, pp. 1\u201315. Springer, Berlin Heidelberg, Berlin, Heidelberg (2007)"},{"unstructured":"ApS, M.: Mosek modeling cookbook (2020)","key":"2059_CR8"},{"issue":"2","key":"2059_CR9","first-page":"609","volume":"68","author":"A Atamt\u00fcrk","year":"2020","unstructured":"Atamt\u00fcrk, A., G\u00f3mez, A.: Submodularity in conic quadratic mixed 0\u20131 optimization. Oper. Res. 68(2), 609\u2013630 (2020)","journal-title":"Oper. Res."},{"key":"2059_CR10","first-page":"1","volume":"201","author":"A Atamt\u00fcrk","year":"2022","unstructured":"Atamt\u00fcrk, A., G\u00f3mez, A.: Supermodularity and valid inequalities for quadratic optimization with indicators. Math. Program. 201, 1\u201344 (2022)","journal-title":"Math. Program."},{"doi-asserted-by":"crossref","unstructured":"Atamt\u00fcrk, A., Narayanan, V.: Submodular function minimization and polarity. Math. Program. (2021)","key":"2059_CR11","DOI":"10.1007\/s10107-020-01607-w"},{"issue":"1","key":"2059_CR12","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1287\/opre.19.1.19","volume":"19","author":"E Balas","year":"1971","unstructured":"Balas, E.: Intersection cuts-a new type of cutting planes for integer programming. Oper. Res. 19(1), 19\u201339 (1971)","journal-title":"Oper. Res."},{"issue":"3","key":"2059_CR13","doi-asserted-by":"crossref","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":"3","key":"2059_CR14","doi-asserted-by":"crossref","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":"2","key":"2059_CR15","doi-asserted-by":"crossref","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."},{"doi-asserted-by":"crossref","unstructured":"Belotti, P., G\u00f3ez, J.C., P\u00f3lik, I., Ralphs, T.K., Terlaky, T.: A conic representation of the convex hull of disjunctive sets and conic cuts for integer second order cone optimization. In: Numerical Analysis and Optimization, pp. 1\u201335. Springer, Berlin (2015)","key":"2059_CR16","DOI":"10.1007\/978-3-319-17689-5_1"},{"unstructured":"Bestuzheva, K., Besan\u00e7on, M., Chen, W.K., Chmiela, A., Donkiewicz, T., van Doornmalen, J., Eifler, L., Gaul, O., Gamrath, G., Gleixner, A., et\u00a0al.: The scip optimization suite 8.0. arXiv preprint arXiv:2112.08872 (2021)","key":"2059_CR17"},{"doi-asserted-by":"crossref","unstructured":"Bestuzheva, K., Chmiela, A., M\u00fcller, B., Serrano, F., Vigerske, S., Wegscheider, F.: Global optimization of mixed-integer nonlinear programs with scip 8. arXiv preprint arXiv:2301.00587 (2023)","key":"2059_CR18","DOI":"10.1007\/s10898-023-01345-1"},{"issue":"1","key":"2059_CR19","doi-asserted-by":"crossref","first-page":"105","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), 105\u2013148 (2020)","journal-title":"Math. Program."},{"issue":"1","key":"2059_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-218X(85)90035-6","volume":"12","author":"A Billionnet","year":"1985","unstructured":"Billionnet, A., Minoux, M.: Maximizing a supermodular pseudoboolean function: a polynomial algorithm for supermodular cubic functions. Discret. Appl. Math. 12(1), 1\u201311 (1985)","journal-title":"Discret. Appl. Math."},{"key":"2059_CR21","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1016\/j.endm.2010.05.086","volume":"36","author":"M Bouhtou","year":"2010","unstructured":"Bouhtou, M., Gaubert, S., Sagnol, G.: Submodularity and randomized rounding techniques for optimal experimental design. Electron. Notes Discret. Math. 36, 679\u2013686 (2010)","journal-title":"Electron. Notes Discret. Math."},{"issue":"1","key":"2059_CR22","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1287\/ijoc.15.1.114.15159","volume":"15","author":"MR Bussieck","year":"2003","unstructured":"Bussieck, M.R., Drud, A.S., Meeraus, A.: Minlplib-a collection of test models for mixed-integer nonlinear programming. Informs. J. Comput. 15(1), 114\u2013119 (2003)","journal-title":"Informs. J. Comput."},{"key":"2059_CR23","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.dam.2022.09.010","volume":"324","author":"R Chen","year":"2023","unstructured":"Chen, R., Dash, S., G\u00fcnl\u00fck, O.: Multilinear sets with two monomials and cardinality constraints. Discret. Appl. Math. 324, 67\u201379 (2023)","journal-title":"Discret. Appl. Math."},{"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)","key":"2059_CR24","DOI":"10.1007\/s10107-022-01808-5"},{"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 (2023). Accepted for publication","key":"2059_CR25","DOI":"10.1007\/978-3-031-32726-1_7"},{"issue":"2","key":"2059_CR26","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/s12532-020-00178-3","volume":"12","author":"C Coey","year":"2020","unstructured":"Coey, C., Lubin, M., Vielma, J.P.: Outer approximation with conic certificates for mixed-integer convex problems. Math. Program. Comput. 12(2), 249\u2013293 (2020)","journal-title":"Math. Program. Comput."},{"issue":"3","key":"2059_CR27","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0166-218X(84)90003-9","volume":"7","author":"M Conforti","year":"1984","unstructured":"Conforti, M., Cornu\u00e9jols, G.: Submodular set functions, matroids and the greedy algorithm: tight worst-case bounds and some generalizations of the rado-edmonds theorem. Discret. Appl. Math. 7(3), 251\u2013274 (1984)","journal-title":"Discret. Appl. Math."},{"key":"2059_CR28","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-11008-0","volume-title":"Integer programming","author":"M Conforti","year":"2014","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Integer programming. Springer International Publishing, Cham (2014)"},{"key":"2059_CR29","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-11008-0","volume-title":"Integer programming","author":"M Conforti","year":"2014","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G., et al.: Integer programming, vol. 271. Springer, Berlin (2014)"},{"issue":"2","key":"2059_CR30","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":"2059_CR31","first-page":"105","volume":"16","author":"M Conforti","year":"2011","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Corner polyhedron and intersection cuts. Surv. Op. Res. Manag. Sci. 16(2), 105\u2013120 (2011)","journal-title":"Surv. Op. Res. Manag. Sci."},{"key":"2059_CR32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-022-01884-7","volume":"196","author":"S Coniglio","year":"2022","unstructured":"Coniglio, S., Furini, F., Ljubi\u0107, I.: Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems. Math. Program. 196, 1\u201348 (2022)","journal-title":"Math. Program."},{"key":"2059_CR33","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/s12532-013-0057-4","volume":"5","author":"G Cornu\u00e9jols","year":"2013","unstructured":"Cornu\u00e9jols, G., Margot, F., Nannicini, G.: On the safety of gomory cut generators. Math. Program. Comput. 5, 345\u2013395 (2013)","journal-title":"Math. Program. Comput."},{"issue":"1","key":"2059_CR34","doi-asserted-by":"crossref","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), 643\u2013651 (2015)","journal-title":"Math. Program."},{"issue":"1","key":"2059_CR35","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF01582138","volume":"61","author":"Y Crama","year":"1993","unstructured":"Crama, Y.: Concave extensions for nonlinear 0\u20131 maximization problems. Math. Program. 61(1), 53\u201360 (1993)","journal-title":"Math. Program."},{"key":"2059_CR36","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511852008","volume-title":"Boolean functions: Theory, algorithms, and applications","author":"Y Crama","year":"2011","unstructured":"Crama, Y., Hammer, P.L.: Boolean functions: Theory, algorithms, and applications. Cambridge University Press, Cambridge (2011)"},{"issue":"2","key":"2059_CR37","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1287\/moor.2016.0804","volume":"42","author":"A Del Pia","year":"2017","unstructured":"Del Pia, A., Khajavirad, A.: A polyhedral study of binary polynomial programs. Math. Oper. Res. 42(2), 389\u2013410 (2017)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"2059_CR38","doi-asserted-by":"crossref","first-page":"1049","DOI":"10.1137\/16M1095998","volume":"28","author":"A Del Pia","year":"2018","unstructured":"Del Pia, A., Khajavirad, A.: The multilinear polytope for acyclic hypergraphs. SIAM J. Optim. 28(2), 1049\u20131076 (2018)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"2059_CR39","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s12532-019-00169-z","volume":"12","author":"A Del Pia","year":"2020","unstructured":"Del Pia, A., Khajavirad, A., Sahinidis, N.V.: On the impact of running intersection inequalities for globally solving polynomial optimization problems. Math. Program. Comput. 12(2), 165\u2013191 (2020)","journal-title":"Math. Program. Comput."},{"doi-asserted-by":"crossref","unstructured":"Del\u00a0Pia, A., Walter, M.: Simple odd-cycle inequalities for binary polynomial optimization. In: International Conference on Integer Programming and Combinatorial Optimization, pp. 181\u2013194. Springer (2022)","key":"2059_CR40","DOI":"10.1007\/978-3-031-06901-7_14"},{"issue":"3","key":"2059_CR41","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10288-012-0198-8","volume":"10","author":"A Del Pia","year":"2012","unstructured":"Del Pia, A., Weismantel, R.: Relaxations of mixed integer sets from lattice-free polyhedra. 4OR 10(3), 221\u2013244 (2012)","journal-title":"4OR"},{"key":"2059_CR42","first-page":"463","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, Berlin Heidelberg, Berlin, Heidelberg (2008)"},{"doi-asserted-by":"crossref","unstructured":"Edmonds, J.: Submodular functions, matroids, and certain polyhedra. In: Combinatorial Optimization-Eureka, You Shrink!, pp. 11\u201326. Springer (2003)","key":"2059_CR43","DOI":"10.1007\/3-540-36478-1_2"},{"unstructured":"en:User:Cburnett: Hamming distance 3 bit binary. https:\/\/commons.wikimedia.org\/wiki\/File:Hamming_distance_3_bit_binary.svg. The image is licensed under CC BY-SA 3.0 (2007)","key":"2059_CR44"},{"issue":"1","key":"2059_CR45","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/s10107-017-1189-5","volume":"172","author":"M Fischetti","year":"2018","unstructured":"Fischetti, M., Ljubi\u0107, I., Monaci, M., Sinnl, M.: On the use of intersection cuts for bilevel optimization. Math. Program. 172(1), 77\u2013103 (2018)","journal-title":"Math. Program."},{"issue":"2","key":"2059_CR46","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1016\/j.ejor.2019.09.043","volume":"282","author":"M Fischetti","year":"2020","unstructured":"Fischetti, M., Monaci, M.: A branch-and-cut algorithm for mixed-integer bilinear programming. Eur. J. Op. Res. 282(2), 506\u2013514 (2020)","journal-title":"Eur. J. Op. Res."},{"issue":"14","key":"2059_CR47","first-page":"17","volume":"4","author":"R Fortet","year":"1960","unstructured":"Fortet, R.: Applications de l\u2019algebre de boole en recherche op\u00e9rationelle. Revue Fran\u00e7aise de Recherche Op\u00e9rationelle 4(14), 17\u201326 (1960)","journal-title":"Revue Fran\u00e7aise de Recherche Op\u00e9rationelle"},{"issue":"1","key":"2059_CR48","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. Op. Res. 21(1), 123\u2013134 (1973). https:\/\/doi.org\/10.1287\/opre.21.1.123","journal-title":"Op. Res."},{"key":"2059_CR49","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/978-3-319-59250-3_18","volume-title":"Integer Programming and Combinatorial Optimization","author":"MX Goemans","year":"2017","unstructured":"Goemans, M.X., Gupta, S., Jaillet, P.: Discrete newton\u2019s algorithm for parametric submodular function minimization. In: Eisenbrand, F., Koenemann, J. (eds.) Integer Programming and Combinatorial Optimization, pp. 212\u2013227. Springer International Publishing, Cham (2017)"},{"issue":"4","key":"2059_CR50","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/0024-3795(69)90017-2","volume":"2","author":"RE Gomory","year":"1969","unstructured":"Gomory, R.E.: Some polyhedra related to combinatorial problems. Linear Algebra Appl. 2(4), 451\u2013558 (1969)","journal-title":"Linear Algebra Appl."},{"key":"2059_CR51","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/978-3-540-68279-0_4","volume-title":"50 Years of Integer Programming 1958\u20132008: From the Early Years to the State-of-the-Art","author":"RE Gomory","year":"2010","unstructured":"Gomory, R.E.: Outline of an algorithm for integer solutions to linear programs and an algorithm for the mixed integer problem. In: J\u00fcnger, M., Liebling, T.M., Naddef, D., Nemhauser, G.L., Pulleyblank, W.R., Reinelt, G., Rinaldi, G., Wolsey, L.A. (eds.) 50 Years of Integer Programming 1958\u20132008: From the Early Years to the State-of-the-Art, pp. 77\u2013103. Springer, Berlin Heidelberg, Berlin, Heidelberg (2010)"},{"key":"2059_CR52","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10898-022-01128-0","volume":"84","author":"S Han","year":"2022","unstructured":"Han, S., G\u00f3mez, A., Prokopyev, O.A.: Fractional 0\u20131 programming and submodularity. J. Glob. Optim. 84, 1\u201317 (2022)","journal-title":"J. Glob. Optim."},{"key":"2059_CR53","volume-title":"Fundamentals of convex analysis","author":"JB Hiriart-Urruty","year":"2004","unstructured":"Hiriart-Urruty, J.B., Lemar\u00e9chal, C.: Fundamentals of convex analysis. Springer, Berlin (2004)"},{"key":"2059_CR54","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02598-7","volume-title":"Global Optimization: Deterministic Approaches","author":"R Horst","year":"1990","unstructured":"Horst, R., Tuy, H.: Global Optimization: Deterministic Approaches. Springer, Berlin (1990)"},{"issue":"1","key":"2059_CR55","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1023\/A:1008321729949","volume":"14","author":"O Khamisov","year":"1999","unstructured":"Khamisov, O.: On optimization properties of functions, with a concave minorant. J. Global Optim. 14(1), 79\u2013101 (1999)","journal-title":"J. Global Optim."},{"doi-asserted-by":"crossref","unstructured":"K\u0131l\u0131n\u00e7-Karzan, F., K\u00fc\u00e7\u00fckyavuz, S., Lee, D.: Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens. Math. Program. pp. 1\u201344 (2021)","key":"2059_CR56","DOI":"10.1007\/s10107-021-01688-1"},{"issue":"3","key":"2059_CR57","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1137\/07070111X","volume":"51","author":"TG Kolda","year":"2009","unstructured":"Kolda, T.G., Bader, B.W.: Tensor decompositions and applications. SIAM Rev. 51(3), 455\u2013500 (2009)","journal-title":"SIAM Rev."},{"issue":"1\u20132","key":"2059_CR58","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/s10107-015-0903-4","volume":"154","author":"F K\u0131l\u0131n\u00e7-Karzan","year":"2015","unstructured":"K\u0131l\u0131n\u00e7-Karzan, F., Y\u0131ld\u0131z, S.: Two-term disjunctions on the second-order cone. Math. Program. 154(1\u20132), 463\u2013491 (2015)","journal-title":"Math. Program."},{"issue":"2","key":"2059_CR59","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1287\/moor.2015.0737","volume":"41","author":"F K\u0131l\u0131n\u00e7-Karzan","year":"2016","unstructured":"K\u0131l\u0131n\u00e7-Karzan, F.: On minimal valid inequalities for mixed integer conic programs. Math. Op. Res. 41(2), 477\u2013510 (2016). https:\/\/doi.org\/10.1287\/moor.2015.0737","journal-title":"Math. Op. Res."},{"issue":"3","key":"2059_CR60","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1111\/j.1475-3995.2008.00604.x","volume":"15","author":"L Liberti","year":"2008","unstructured":"Liberti, L.: Spherical cuts for integer programming problems. Int. Trans. Op. Res. 15(3), 283\u2013294 (2008)","journal-title":"Int. Trans. Op. Res."},{"issue":"05","key":"2059_CR61","doi-asserted-by":"crossref","first-page":"L05003","DOI":"10.1088\/1742-5468\/2010\/05\/L05003","volume":"2010","author":"F Liers","year":"2010","unstructured":"Liers, F., Marinari, E., Pagacz, U., Ricci-Tersenghi, F., Schmitz, V.: A non-disordered glassy model with a tunable interaction range. J. Stat. Mech: Theory Exp. 2010(05), L05003 (2010)","journal-title":"J. Stat. Mech: Theory Exp."},{"key":"2059_CR62","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/978-3-642-68874-4_10","volume-title":"Mathematical programming the state of the art","author":"L Lov\u00e1sz","year":"1983","unstructured":"Lov\u00e1sz, L.: Submodular functions and convexity. In: Mathematical programming the state of the art, pp. 235\u2013257. Springer, Berlin (1983)"},{"issue":"1","key":"2059_CR63","doi-asserted-by":"crossref","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-convex underestimating problems. Math. Program. 10(1), 147\u2013175 (1976)","journal-title":"Math. Program."},{"issue":"1","key":"2059_CR64","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/j.orl.2014.10.006","volume":"43","author":"S Modaresi","year":"2015","unstructured":"Modaresi, S., Kilin\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":"2059_CR65","doi-asserted-by":"crossref","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., Paat, J., Serrano, F.: Towards a characterization of maximal quadratic-free sets. arXiv preprint arXiv:2211.05185 (2022)","key":"2059_CR66","DOI":"10.1007\/978-3-031-32726-1_24"},{"issue":"1","key":"2059_CR67","doi-asserted-by":"crossref","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(1), 229\u2013270 (2022)","journal-title":"Math. Program."},{"issue":"1","key":"2059_CR68","first-page":"313","volume":"83","author":"K Murota","year":"1998","unstructured":"Murota, K.: Discrete convex analysis. Math. Program. 83(1), 313\u2013371 (1998)","journal-title":"Math. Program."},{"doi-asserted-by":"crossref","unstructured":"Nemhauser, G., Wolsey, L.: Matroid and submodular function optimization (1988)","key":"2059_CR69","DOI":"10.1002\/9781118627372.ch16"},{"issue":"1","key":"2059_CR70","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions-i. Math. Program. 14(1), 265\u2013294 (1978)","journal-title":"Math. Program."},{"key":"2059_CR71","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-91578-4","volume-title":"Lectures on convex optimization","author":"Y Nesterov","year":"2018","unstructured":"Nesterov, Y., et al.: Lectures on convex optimization, vol. 137. Springer, Berlin (2018)"},{"unstructured":"Pagacz, U.: POLIP: Library for polynomially constrained mixed-integer programming (2023). https:\/\/polip.zib.de\/. Online accessed","key":"2059_CR72"},{"key":"2059_CR73","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/s10107-008-0235-8","volume":"121","author":"F Rendl","year":"2010","unstructured":"Rendl, F., Rinaldi, G., Wiegele, A.: Solving max-cut to optimality by intersecting semidefinite and polyhedral relaxations. Math. Program. 121, 307\u2013335 (2010)","journal-title":"Math. Program."},{"issue":"3","key":"2059_CR74","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1287\/mnsc.17.3.200","volume":"17","author":"JM Rhys","year":"1970","unstructured":"Rhys, J.M.: A selection problem of shared fixed costs and network flows. Manage. Sci. 17(3), 200\u2013207 (1970)","journal-title":"Manage. Sci."},{"doi-asserted-by":"crossref","unstructured":"Richard, J.P.P., Dey, S.S.: The group-theoretic approach in mixed integer programming. In: 50 Years of Integer Programming 1958-2008, pp. 727\u2013801. Springer (2010)","key":"2059_CR75","DOI":"10.1007\/978-3-540-68279-0_19"},{"unstructured":"Rinaldi, G.: Rudy. http:\/\/www-user.tu-chemnitz.de\/helmberg\/rudy.tar.gz (1998)","key":"2059_CR76"},{"issue":"1\u20132","key":"2059_CR77","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/j.dam.2012.07.016","volume":"161","author":"G Sagnol","year":"2013","unstructured":"Sagnol, G.: Approximation of a maximum-submodular-coverage problem involving spectral functions, with application to experimental designs. Discret. Appl. Math. 161(1\u20132), 258\u2013276 (2013)","journal-title":"Discret. Appl. Math."},{"issue":"5","key":"2059_CR78","doi-asserted-by":"crossref","first-page":"2198","DOI":"10.1214\/15-AOS1339","volume":"43","author":"G Sagnol","year":"2015","unstructured":"Sagnol, G., Harman, R.: Computing exact $$ d $$-optimal designs by mixed integer second-order cone programming. Ann. Stat. 43(5), 2198\u20132224 (2015)","journal-title":"Ann. Stat."},{"issue":"2","key":"2059_CR79","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/s10107-010-0340-3","volume":"130","author":"A Saxena","year":"2011","unstructured":"Saxena, A., Bonami, P., Lee, J.: Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations. Math. Program. 130(2), 359\u2013413 (2011)","journal-title":"Math. Program."},{"key":"2059_CR80","volume-title":"Combinatorial optimization: polyhedra and efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A., et al.: Combinatorial optimization: polyhedra and efficiency, vol. 24. Springer, Cham (2003)"},{"key":"2059_CR81","doi-asserted-by":"crossref","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.) Integer Programming and Combinatorial Optimization, pp. 385\u2013398. Springer International Publishing, Cham (2019)"},{"doi-asserted-by":"crossref","unstructured":"Shamaiah, M., Banerjee, S., Vikalo, H.: Greedy sensor selection: Leveraging submodularity. In: 49th IEEE conference on decision and control (CDC), pp. 2572\u20132577. IEEE (2010)","key":"2059_CR82","DOI":"10.1109\/CDC.2010.5717225"},{"doi-asserted-by":"crossref","unstructured":"Shi, X., Prokopyev, O.A., Zeng, B.: Sequence independent lifting for a set of submodular maximization problems. Math. Program. pp. 1\u201346 (2022)","key":"2059_CR83","DOI":"10.1007\/s10107-022-01801-y"},{"issue":"2","key":"2059_CR84","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10107-005-0581-8","volume":"103","author":"M Tawarmalani","year":"2005","unstructured":"Tawarmalani, M., Sahinidis, N.V.: A polyhedral branch-and-cut approach to global optimization. Math. Program. 103(2), 225\u2013249 (2005)","journal-title":"Math. Program."},{"key":"2059_CR85","doi-asserted-by":"crossref","DOI":"10.1515\/9781400822539","volume-title":"Supermodularity and complementarity","author":"DM Topkis","year":"2011","unstructured":"Topkis, D.M.: Supermodularity and complementarity. Princeton University Press, Princeton (2011)"},{"issue":"1","key":"2059_CR86","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1287\/moor.2021.1132","volume":"47","author":"E Towle","year":"2022","unstructured":"Towle, E., Luedtke, J.: Intersection disjunctions for reverse convex sets. Math. Op. Res. 47(1), 297\u2013319 (2022)","journal-title":"Math. Op. Res."},{"key":"2059_CR87","first-page":"1437","volume":"5","author":"H Tuy","year":"1964","unstructured":"Tuy, H.: Concave programming under linear constraints. Sov. Math. 5, 1437\u20131440 (1964)","journal-title":"Sov. Math."},{"unstructured":"Vigerske, S.: MINLPLib: A Library of Mixed-Integer and Continuous Nonlinear Programming Instances (2022). https:\/\/www.minlplib.org\/. Online accessed","key":"2059_CR88"},{"unstructured":"Wiegele, A.: Biq mac library-a collection of max-cut and quadratic 0-1 programming instances of medium size. Preprint 51 (2007)","key":"2059_CR89"},{"doi-asserted-by":"publisher","unstructured":"Xu, L., D\u2019Ambrosio, C., Liberti, L., Vanier, S.H.: On cutting planes for extended formulation of signomial programming (2022). https:\/\/doi.org\/10.48550\/ARXIV.2212.02857","key":"2059_CR90","DOI":"10.48550\/ARXIV.2212.02857"},{"doi-asserted-by":"crossref","unstructured":"Yu, Q., K\u00fc\u00e7\u00fckyavuz, S.: Strong valid inequalities for a class of concave submodular minimization problems under cardinality constraints. Math. Program. pp. 1\u201359 (2023)","key":"2059_CR91","DOI":"10.1007\/s10107-022-01921-5"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-024-02059-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-024-02059-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-024-02059-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,28]],"date-time":"2025-04-28T13:56:30Z","timestamp":1745848590000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-024-02059-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,19]]},"references-count":91,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2025,5]]}},"alternative-id":["2059"],"URL":"https:\/\/doi.org\/10.1007\/s10107-024-02059-2","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2024,2,19]]},"assertion":[{"value":"27 February 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 January 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 February 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":"We have no conflict of interest with the journal or the funding agencies.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}