{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T05:39:55Z","timestamp":1740807595792,"version":"3.38.0"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2025,1,29]],"date-time":"2025-01-29T00:00:00Z","timestamp":1738108800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,29]],"date-time":"2025-01-29T00:00:00Z","timestamp":1738108800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-23-1-0340"],"award-info":[{"award-number":["FA9550-23-1-0340"]}],"id":[{"id":"10.13039\/100000181","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-02185-x","type":"journal-article","created":{"date-parts":[[2025,1,29]],"date-time":"2025-01-29T13:02:53Z","timestamp":1738155773000},"page":"567-590","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Monoidal strengthening of simple $$\\mathcal {V}$$-polyhedral disjunctive cuts"],"prefix":"10.1007","volume":"210","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4949-9565","authenticated-orcid":false,"given":"Aleksandr M.","family":"Kazachkov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Egon","family":"Balas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,1,29]]},"reference":[{"issue":"4","key":"2185_CR1","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/j.orl.2005.07.009","volume":"34","author":"T Achterberg","year":"2006","unstructured":"Achterberg, T., Koch, T., Martin, A.: MIPLIB 2003. Oper. Res. Lett. 34(4), 361\u2013372 (2006). https:\/\/doi.org\/10.1016\/j.orl.2005.07.009","journal-title":"Oper. Res. Lett."},{"issue":"3, Ser. A","key":"2185_CR2","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/s10107-004-0558-z","volume":"102","author":"K Andersen","year":"2005","unstructured":"Andersen, K., Cornu\u00e9jols, G., Li, Y.: Split closure and intersection cuts. Math. Program. 102(3, Ser. A), 457\u2013493 (2005). https:\/\/doi.org\/10.1007\/s10107-004-0558-z","journal-title":"Math. Program."},{"issue":"1","key":"2185_CR3","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.disopt.2011.11.002","volume":"9","author":"E Balas","year":"2012","unstructured":"Balas, E., Qualizza, A.: Monoidal cut strengthening revisited. Discrete Optim. 9(1), 40\u201349 (2012). https:\/\/doi.org\/10.1016\/j.disopt.2011.11.002","journal-title":"Discrete Optim."},{"issue":"1","key":"2185_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\u2014a new type of cutting planes for integer programming. Oper. Res. 19(1), 19\u201339 (1971)","journal-title":"Oper. Res."},{"key":"2185_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0167-5060(08)70342-X","volume":"5","author":"E Balas","year":"1979","unstructured":"Balas, E.: Disjunctive programming. Ann. Discrete Math. 5, 3\u201351 (1979). https:\/\/doi.org\/10.1016\/S0167-5060(08)70342-X","journal-title":"Ann. Discrete Math."},{"issue":"4","key":"2185_CR6","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). https:\/\/doi.org\/10.1016\/0377-2217(80)90106-X","journal-title":"Eur. J. Oper. Res."},{"key":"2185_CR7","doi-asserted-by":"publisher","unstructured":"Balas, E., Kazachkov, A.M.: $$\\cal{V}$$-polyhedral disjunctive cuts (2024). Extended manuscript. https:\/\/doi.org\/10.48550\/arXiv.2207.13619","DOI":"10.48550\/arXiv.2207.13619"},{"key":"2185_CR8","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.disopt.2015.10.001","volume":"18","author":"E Balas","year":"2015","unstructured":"Balas, E., Kis, T.: Intersection cuts\u2014standard versus restricted. Discrete Optim. 18, 189\u2013192 (2015). https:\/\/doi.org\/10.1016\/j.disopt.2015.10.001","journal-title":"Discrete Optim."},{"key":"2185_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-015-0975-1","volume":"160","author":"E Balas","year":"2016","unstructured":"Balas, E., Kis, T.: On the relationship between standard intersection cuts, lift-and-project cuts and generalized intersection cuts. Math. Program. 160, 1\u201330 (2016). https:\/\/doi.org\/10.1007\/s10107-015-0975-1","journal-title":"Math. Program."},{"issue":"2\u20133, Ser. B","key":"2185_CR10","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10107-002-0317-y","volume":"94","author":"E Balas","year":"2003","unstructured":"Balas, E., Perregaard, M.: A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer Gomory cuts for $$0$$\u2013$$1$$ programming. Math. Program. 94(2\u20133, Ser. B), 221\u2013245 (2003). https:\/\/doi.org\/10.1007\/s10107-002-0317-y. (The Aussois 2000 Workshop in Combinatorial Optimization)","journal-title":"Math. Program."},{"issue":"1","key":"2185_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s13675-013-0008-x","volume":"1","author":"E Balas","year":"2013","unstructured":"Balas, E., Qualizza, A.: Intersection cuts from multiple rows: a disjunctive programming approach. EURO J. Comput. Optim. 1(1), 3\u201349 (2013). https:\/\/doi.org\/10.1007\/s13675-013-0008-x","journal-title":"EURO J. Comput. Optim."},{"issue":"3","key":"2185_CR12","doi-asserted-by":"publisher","first-page":"822","DOI":"10.1287\/ijoc.2019.0943","volume":"32","author":"E Balas","year":"2020","unstructured":"Balas, E., Serra, T.: When lift-and-project cuts are different. INFORMS J. Comput. 32(3), 822\u2013834 (2020). https:\/\/doi.org\/10.1287\/ijoc.2019.0943","journal-title":"INFORMS J. Comput."},{"issue":"3, Ser. A","key":"2185_CR13","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"E Balas","year":"1993","unstructured":"Balas, E., Ceria, S., Cornu\u00e9jols, G.: A lift-and-project cutting plane algorithm for mixed $$0$$\u2013$$1$$ programs. Math. Program. 58(3, Ser. A), 295\u2013324 (1993). https:\/\/doi.org\/10.1007\/BF01581273","journal-title":"Math. Program."},{"issue":"9","key":"2185_CR14","doi-asserted-by":"publisher","first-page":"1229","DOI":"10.1287\/mnsc.42.9.1229","volume":"42","author":"E Balas","year":"1996","unstructured":"Balas, E., Ceria, S., Cornu\u00e9jols, G.: Mixed $$0$$\u2013$$1$$ programming by lift-and-project in a branch-and-cut framework. Man. Sci. 42(9), 1229\u20131246 (1996). https:\/\/doi.org\/10.1287\/mnsc.42.9.1229","journal-title":"Man. Sci."},{"issue":"4","key":"2185_CR15","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1287\/ijoc.1100.0437","volume":"23","author":"A Basu","year":"2011","unstructured":"Basu, A., Bonami, P., Cornu\u00e9jols, G., Margot, F.: Experiments with two-row cuts from degenerate tableaux. INFORMS J. Comput. 23(4), 578\u2013590 (2011). https:\/\/doi.org\/10.1287\/ijoc.1100.0437","journal-title":"INFORMS J. Comput."},{"key":"2185_CR16","first-page":"16","volume":"25","author":"RE Bixby","year":"1992","unstructured":"Bixby, R.E., Boyd, E.A., Indovina, R.R.: MIPLIB: a test set of mixed integer programming problems. SIAM News 25, 16 (1992)","journal-title":"SIAM News"},{"key":"2185_CR17","first-page":"12","volume":"58","author":"RE Bixby","year":"1998","unstructured":"Bixby, R.E., Ceria, S., McZeal, C.M., Savelsbergh, M.W.P.: An updated mixed integer programming library: MIPLIB 3.0. Optima 58, 12\u201315 (1998)","journal-title":"Optima"},{"issue":"2","key":"2185_CR18","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s12532-012-0037-0","volume":"4","author":"P Bonami","year":"2012","unstructured":"Bonami, P.: On optimizing over lift-and-project closures. Math. Program. Comput. 4(2), 151\u2013179 (2012). https:\/\/doi.org\/10.1007\/s12532-012-0037-0","journal-title":"Math. Program. Comput."},{"issue":"5","key":"2185_CR19","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1016\/j.orl.2013.05.005","volume":"41","author":"P Bonami","year":"2013","unstructured":"Bonami, P., Conforti, M., Cornu\u00e9jols, G., Molinaro, M., Zambelli, G.: Cutting planes from two-term disjunctions. Oper. Res. Lett. 41(5), 442\u2013444 (2013). https:\/\/doi.org\/10.1016\/j.orl.2013.05.005","journal-title":"Oper. Res. Lett."},{"key":"2185_CR20","unstructured":"COIN-OR Branch and Cut. COIN-OR Branch and Cut. https:\/\/github.com\/coin-or\/Cbc (2023). Commit d4272be"},{"key":"2185_CR21","unstructured":"COIN-OR Cut Generation Library. COIN-OR Cut Generation Library. https:\/\/github.com\/coin-or\/Cgl (2023). Commit 3ea7bff"},{"key":"2185_CR22","unstructured":"COIN-OR Linear Programming. COIN-OR Linear Programming. https:\/\/github.com\/coin-or\/Clp (2023). Commit 8294096"},{"key":"2185_CR23","doi-asserted-by":"publisher","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Integer Programming, volume 271 of Graduate Texts in Mathematics. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11008-0","DOI":"10.1007\/978-3-319-11008-0"},{"issue":"1","key":"2185_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0167-6377(00)00067-5","volume":"28","author":"G Cornu\u00e9jols","year":"2001","unstructured":"Cornu\u00e9jols, G., Li, Y.: Elementary closures for integer programs. Oper. Res. Lett. 28(1), 1\u20138 (2001). https:\/\/doi.org\/10.1016\/S0167-6377(00)00067-5","journal-title":"Oper. Res. Lett."},{"issue":"1\u20132, Ser. B","key":"2185_CR25","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, Ser. B), 143\u2013174 (2010). https:\/\/doi.org\/10.1007\/s10107-010-0362-x","journal-title":"Math. Program."},{"issue":"2","key":"2185_CR26","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1287\/ijoc.2013.0559","volume":"26","author":"SS Dey","year":"2014","unstructured":"Dey, S.S., Lodi, A., Tramontani, A., Wolsey, L.A.: On the practical strength of two-row tableau cuts. INFORMS J. Comput. 26(2), 222\u2013237 (2014). https:\/\/doi.org\/10.1287\/ijoc.2013.0559","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"2185_CR27","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.orl.2009.10.016","volume":"38","author":"DG Espinoza","year":"2010","unstructured":"Espinoza, D.G.: Computing with multi-row Gomory cuts. Oper. Res. Lett. 38(2), 115\u2013120 (2010). https:\/\/doi.org\/10.1016\/j.orl.2009.10.016","journal-title":"Oper. Res. Lett."},{"key":"2185_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1515\/crll.1902.124.1","volume":"124","author":"J Farkas","year":"1902","unstructured":"Farkas, J.: Theorie der einfachen Ungleichungen. J. Reine Angew. Math. 124, 1\u201327 (1902). https:\/\/doi.org\/10.1515\/crll.1902.124.1","journal-title":"J. Reine Angew. Math."},{"issue":"6","key":"2185_CR29","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1016\/j.orl.2017.08.012","volume":"45","author":"T Fischer","year":"2017","unstructured":"Fischer, T., Pfetsch, M.E.: Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints. Oper. Res. Lett. 45(6), 556\u2013560 (2017). https:\/\/doi.org\/10.1016\/j.orl.2017.08.012","journal-title":"Oper. Res. Lett."},{"issue":"1\u20132, Ser. A","key":"2185_CR30","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/s10107-009-0300-y","volume":"128","author":"M Fischetti","year":"2011","unstructured":"Fischetti, M., Lodi, A., Tramontani, A.: On the separation of disjunctive cuts. Math. Program. 128(1\u20132, Ser. A), 205\u2013230 (2011). https:\/\/doi.org\/10.1007\/s10107-009-0300-y","journal-title":"Math. Program."},{"issue":"2","key":"2185_CR31","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s12532-018-0146-5","volume":"11","author":"R Fukasawa","year":"2019","unstructured":"Fukasawa, R., Poirrier, L., Xavier, \u00c1.S.: The (not so) trivial lifting in two dimensions. Math. Program. Comput. 11(2), 211\u2013235 (2019). https:\/\/doi.org\/10.1007\/s12532-018-0146-5","journal-title":"Math. Program. Comput."},{"key":"2185_CR32","doi-asserted-by":"publisher","unstructured":"Gleixner, A., Hendel, G., Gamrath, G., Achterberg, T., Bastubbe, M., Berthold, T., Christophel, P.M., Jarck, K., Koch, T., Linderoth, J., L\u00fcbbecke, M., Mittelmann, H.D., Ozyurt, D., Ralphs, T.K., Salvagnin, D., Yuji Shinano, MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library. Math. Program. Comput. 2021,(2017). https:\/\/doi.org\/10.1007\/s12532-020-00194-3","DOI":"10.1007\/s12532-020-00194-3"},{"issue":"1","key":"2185_CR33","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)","journal-title":"Math. Program."},{"key":"2185_CR34","unstructured":"Guennebaud, G., Jacob, B., et\u00a0al.: Eigen v3. http:\/\/eigen.tuxfamily.org (2010). Commit 2873916f"},{"key":"2185_CR35","unstructured":"Gurobi Optimization, LLC. Gurobi Optimizer Reference Manual (2023). https:\/\/www.gurobi.com. Version 10.0.3"},{"key":"2185_CR36","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/BFb0120692","volume":"2","author":"EL Johnson","year":"1974","unstructured":"Johnson, E.L.: On the group problem for mixed integer programming. Math. Program. Stud. 2, 137\u2013179 (1974)","journal-title":"Math. Program. Stud."},{"issue":"1","key":"2185_CR37","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s10898-006-9001-8","volume":"36","author":"JJ J\u00fadice","year":"2006","unstructured":"J\u00fadice, J.J., Sherali, H.D., Ribeiro, I.M., Faustino, A.M.: A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints. J. Global Optim. 36(1), 89\u2013114 (2006). https:\/\/doi.org\/10.1007\/s10898-006-9001-8","journal-title":"J. Global Optim."},{"key":"2185_CR38","doi-asserted-by":"publisher","unstructured":"Kazachkov, A.M.: Non-recursive cut generation. PhD Thesis. Carnegie Mellon University (2018). https:\/\/doi.org\/10.1184\/R1\/6720881.v1","DOI":"10.1184\/R1\/6720881.v1"},{"key":"2185_CR39","doi-asserted-by":"publisher","unstructured":"Kazachkov, A.M., Balas, E.: Monoidal strengthening of simple $$\\cal{V}$$-polyhedral disjunctive cuts. In: Del\u00a0Pia, A., Kaibel, V. (eds.) Integer Programming and Combinatorial Optimization, volume 13904 of Lecture Notes in Computer Sciences, pp. 275\u2013290. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-32726-1_20","DOI":"10.1007\/978-3-031-32726-1_20"},{"key":"2185_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-54621-2_758-1","volume-title":"Monoidal Strengthening","author":"AM Kazachkov","year":"2022","unstructured":"Kazachkov, A.M., Serrano, F.: Monoidal Strengthening, pp. 1\u20138. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-54621-2_758-1"},{"issue":"3","key":"2185_CR41","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1007\/s10589-014-9690-8","volume":"59","author":"M K\u0131l\u0131n\u00e7","year":"2014","unstructured":"K\u0131l\u0131n\u00e7, M., Linderoth, J., Luedtke, J., Miller, A.: Strong-branching inequalities for convex mixed integer nonlinear programs. Comput. Optim. Appl. 59(3), 639\u2013665 (2014). https:\/\/doi.org\/10.1007\/s10589-014-9690-8","journal-title":"Comput. Optim. Appl."},{"key":"2185_CR42","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.disopt.2014.02.001","volume":"12","author":"T Kis","year":"2014","unstructured":"Kis, T.: Lift-and-project for general two-term disjunctions. Discrete Optim. 12, 98\u2013114 (2014). https:\/\/doi.org\/10.1016\/j.disopt.2014.02.001","journal-title":"Discrete Optim."},{"issue":"2","key":"2185_CR43","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s12532-011-0025-9","volume":"3","author":"T Koch","year":"2011","unstructured":"Koch, T., Achterberg, T., Andersen, E., Bastert, O., Berthold, T., Bixby, R.E., Danna, E., Gamrath, G., Gleixner, A.M., Heinz, S., Lodi, A., Mittelmann, H., Ralphs, T., Salvagnin, D., Steffy, D.E., Wolter, K.: MIPLIB 2010: mixed integer programming library version 5. Math. Program. Comput. 3(2), 103\u2013163 (2011). https:\/\/doi.org\/10.1007\/s12532-011-0025-9","journal-title":"Math. Program. Comput."},{"issue":"3","key":"2185_CR44","doi-asserted-by":"publisher","first-page":"1315","DOI":"10.1007\/s11081-020-09551-6","volume":"22","author":"J Kronqvist","year":"2021","unstructured":"Kronqvist, J., Misener, R.: A disjunctive cut strengthening technique for convex MINLP. Optim. Eng. 22(3), 1315\u20131345 (2021). https:\/\/doi.org\/10.1007\/s11081-020-09551-6","journal-title":"Optim. Eng."},{"key":"2185_CR45","unstructured":"Linderoth, J., Ralphs, T.K.: Computational Optimization Research at Lehigh. MIP instances. http:\/\/coral.ise.lehigh.edu\/data-sets\/mixed-integer-instances\/ (2020). Accessed September 2020"},{"key":"2185_CR46","doi-asserted-by":"crossref","unstructured":"Lougee-Heimer, R.: The Common Optimization Interface for Operations Research: promoting open-source software in the operations research community. IBM J. Res. Dev. 47, 57 (2003)","DOI":"10.1147\/rd.471.0057"},{"issue":"2","key":"2185_CR47","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s12532-014-0076-9","volume":"7","author":"Q Louveaux","year":"2015","unstructured":"Louveaux, Q., Poirrier, L., Salvagnin, D.: The strength of multi-row models. Math. Program. Comput. 7(2), 113\u2013148 (2015). https:\/\/doi.org\/10.1007\/s12532-014-0076-9","journal-title":"Math. Program. Comput."},{"key":"2185_CR48","series-title":"Wiley-Interscience Series in Discrete Mathematics and Optimization","doi-asserted-by":"publisher","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"GL Nemhauser","year":"1988","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley-Interscience Series in Discrete Mathematics and Optimization, Wiley, New York (1988). https:\/\/doi.org\/10.1002\/9781118627372"},{"issue":"3","key":"2185_CR49","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF01585752","volume":"46","author":"GL Nemhauser","year":"1990","unstructured":"Nemhauser, G.L., Wolsey, L.A.: A recursive procedure to generate all cuts for $$0$$\u2013$$1$$ mixed integer programs. Math. Program. 46(3), 379\u2013390 (1990). https:\/\/doi.org\/10.1007\/BF01585752","journal-title":"Math. Program."},{"key":"2185_CR50","unstructured":"Perregaard, M.: Generating Disjunctive Cuts for Mixed Integer Programs. PhD Thesis, Carnegie Mellon University, 9 (2003)"},{"key":"2185_CR51","doi-asserted-by":"publisher","unstructured":"Perregaard, M., Balas, E.: Generating cuts from multiple-term disjunctions. In: Integer Programming and Combinatorial Optimization, volume 2081 of Lecture Notes in Computer Science, pp. 348\u2013360. Springer, Berlin (2001). https:\/\/doi.org\/10.1007\/3-540-45535-3_27","DOI":"10.1007\/3-540-45535-3_27"},{"issue":"4","key":"2185_CR52","doi-asserted-by":"publisher","first-page":"1624","DOI":"10.1287\/ijoc.2020.1027","volume":"33","author":"\u00c1S Xavier","year":"2021","unstructured":"Xavier, \u00c1.S., Fukasawa, R., Poirrier, L.: Multirow intersection cuts based on the infinity norm. INFORMS J. Comput. 33(4), 1624\u20131643 (2021). https:\/\/doi.org\/10.1287\/ijoc.2020.1027","journal-title":"INFORMS J. Comput."},{"key":"2185_CR53","doi-asserted-by":"publisher","unstructured":"Ziegler, G.M.: Lectures on Polytopes, volume 152 of Graduate Texts in Mathematics. Springer, New York (1995). https:\/\/doi.org\/10.1007\/978-1-4613-8431-1","DOI":"10.1007\/978-1-4613-8431-1"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-024-02185-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-024-02185-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-024-02185-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T16:05:50Z","timestamp":1740758750000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-024-02185-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,29]]},"references-count":53,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["2185"],"URL":"https:\/\/doi.org\/10.1007\/s10107-024-02185-x","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2025,1,29]]},"assertion":[{"value":"28 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 November 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 January 2025","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 have no conflict of interest to declare.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}