{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T16:38:25Z","timestamp":1772642305808,"version":"3.50.1"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T00:00:00Z","timestamp":1760486400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T00:00:00Z","timestamp":1760486400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001652","name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001652","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2026,3]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Decomposition methods can be used to create efficient solution algorithms for a wide range of optimization problems. For example, Benders Decomposition can be used to solve scenario-expanded two-stage stochastic optimization problems effectively. Benders Decomposition iteratively generates Benders cuts by solving a simplified version of an optimization problem, the so-called subproblem. The choice of the generated cuts can impact the performance of this approach. Several approaches to making this choice are known. The Magnanti-Wong method focuses on generating Pareto-optimal cuts. Cuts based on minimal infeasible subsystems of a modified version of the subproblem have been proven to be effective. Additionally, methods that use facets of the subproblem \u2019s value function epigraph have been developed recently. We have made a contribution to the field of cut selection strategies for Benders Decomposition by introducing a novel concept of Pareto-optimality, which leads to an efficient cut selection strategy. This strategy aims for cuts that exclude a large set of points from being optimal. Furthermore, we have established the algorithmic framework to fully leverage the potential of our cut selection strategy. We have compared our cut selection strategy with several others on various instances, including instances from the MIPLib, network design problems, and randomly generated mixed-integer linear programs. The computational results indicate that our method solves problems faster than the benchmark approaches, particularly when combined as a hybrid selection strategy with the minimal infeasible subsystem cut selection. Moreover, the method clearly outperforms the other cut selection strategies in terms of the number of cuts required to solve a problem optimally. Therefore, this method is particularly effective in situations with limited memory or in cases where the subproblem is challenging to solve.<\/jats:p>","DOI":"10.1007\/s12532-025-00291-1","type":"journal-article","created":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T16:00:10Z","timestamp":1760544010000},"page":"211-257","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A novel Pareto-optimal cut selection strategy for Benders Decomposition"],"prefix":"10.1007","volume":"18","author":[{"given":"Lukas","family":"Glomb","sequence":"first","affiliation":[]},{"given":"Frauke","family":"Liers","sequence":"additional","affiliation":[]},{"given":"Florian","family":"R\u00f6sel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,15]]},"reference":[{"key":"291_CR1","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s12532-015-0079-1","volume":"7","author":"A B\u00e4rmann","year":"2015","unstructured":"B\u00e4rmann, A., Liers, F., Martin, A., Merkert, M., Thurner, C., Weninger, D.: Solving network design problems via iterative aggregation. Math. Program. Comput. 7, 189\u2013217 (2015). https:\/\/doi.org\/10.1007\/s12532-015-0079-1","journal-title":"Math. Program. Comput."},{"key":"291_CR2","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.enconman.2013.03.013","volume":"71","author":"HR Abdolmohammadi","year":"2013","unstructured":"Abdolmohammadi, H.R., Kazemi, A.: A benders decomposition approach for a combined heat and power economic dispatch. Energy Convers. Manage. 71, 21\u201331 (2013). https:\/\/doi.org\/10.1016\/j.enconman.2013.03.013","journal-title":"Energy Convers. Manage."},{"issue":"4","key":"291_CR3","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1287\/opre.2015.1401","volume":"63","author":"Y Adulyasak","year":"2015","unstructured":"Adulyasak, Y., Cordeau, J.-F., Jans, R.: Benders decomposition for production routing under demand uncertainty. Oper. Res. 63(4), 851\u2013867 (2015). https:\/\/doi.org\/10.1287\/opre.2015.1401","journal-title":"Oper. Res."},{"key":"291_CR4","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10479-012-1146-x","volume":"210","author":"N Azad","year":"2013","unstructured":"Azad, N., Saharidis, G.K., Davoudpour, H., Malekly, H., Yektamaram, S.A.: Strategies for protecting supply chain networks against facility and transportation disruptions: an improved benders decomposition approach. Ann. Oper. Res. 210, 125\u2013163 (2013). https:\/\/doi.org\/10.1007\/s10479-012-1146-x","journal-title":"Ann. Oper. Res."},{"issue":"1\u20133","key":"291_CR5","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0166-218X(01)00340-7","volume":"123","author":"E Balas","year":"2002","unstructured":"Balas, E., Perregaard, M.: Lift-and-project for mixed 0\u20131 programming: recent progress. Discret. Appl. Math. 123(1\u20133), 129\u2013154 (2002). https:\/\/doi.org\/10.1016\/S0166-218X(01)00340-7","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"291_CR6","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1109\/TPWRS.2011.2167764","volume":"27","author":"L Baringo","year":"2011","unstructured":"Baringo, L., Conejo, A.J.: Wind power investment: a benders decomposition approach. IEEE Trans. Power Syst. 27(1), 433\u2013441 (2011). https:\/\/doi.org\/10.1109\/TPWRS.2011.2167764","journal-title":"IEEE Trans. Power Syst."},{"issue":"2","key":"291_CR7","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1287\/trsc.2017.0762","volume":"52","author":"V Bayram","year":"2018","unstructured":"Bayram, V., Yaman, H.: Shelter location and evacuation route assignment under uncertainty: a benders decomposition approach. Transp. Sci. 52(2), 416\u2013436 (2018). https:\/\/doi.org\/10.1287\/trsc.2017.0762","journal-title":"Transp. Sci."},{"issue":"1","key":"291_CR8","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"J Benders","year":"1962","unstructured":"Benders, J.: Partitioning procedures for solving mixed-variables programming problems. Numer. Math. 4(1), 238\u2013252 (1962)","journal-title":"Numer. Math."},{"key":"291_CR9","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-030-45771-6_7","volume":"2020","author":"Bonami, P., Salvagnin, D., Tramontani, A. (2020). Implementing automatic benders decomposition in a modern mip solver. Integer Programming and Combinatorial Optimization: 21st International Conference, IPCO","year":"2020","unstructured":"Bonami, P., Salvagnin, D., Tramontani, A. (2020). Implementing automatic benders decomposition in a modern mip solver. Integer Programming and Combinatorial Optimization: 21st International Conference, IPCO: London, uk, june 8\u201310. Proceedings 2020, 78\u201390 (2020). https:\/\/doi.org\/10.1007\/978-3-030-45771-6_7","journal-title":"Proceedings"},{"issue":"1","key":"291_CR10","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1287\/ijoc.1110.0472","volume":"25","author":"Q Botton","year":"2013","unstructured":"Botton, Q., Fortz, B., Gouveia, L., Poss, M.: Benders decomposition for the hop-constrained survivable network design problem. INFORMS J. Comput. 25(1), 13\u201326 (2013). https:\/\/doi.org\/10.1287\/ijoc.1110.0472","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"291_CR11","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s00186-021-00756-8","volume":"94","author":"R Brandenberg","year":"2021","unstructured":"Brandenberg, R., Stursberg, P.: Refined cut selection for benders decomposition: applied to network capacity expansion problems. Math. Methods Oper. Res. 94(3), 383\u2013412 (2021). https:\/\/doi.org\/10.1007\/s00186-021-00756-8","journal-title":"Math. Methods Oper. Res."},{"issue":"3\u20134","key":"291_CR12","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1002\/nav.3800090303","volume":"9","author":"A Charnes","year":"1962","unstructured":"Charnes, A., Cooper, W.W.: Programming with linear fractional functionals. Naval Research logistics quarterly 9(3\u20134), 181\u2013186 (1962). https:\/\/doi.org\/10.1002\/nav.3800090303","journal-title":"Naval Research logistics quarterly"},{"key":"291_CR13","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s10107-018-1299-8","volume":"178","author":"M Conforti","year":"2019","unstructured":"Conforti, M., Wolsey, L.A.: \u201cfacet\u2019\u2019 separation with one linear program. Math. Program. 178, 361\u2013380 (2019). https:\/\/doi.org\/10.1007\/s10107-018-1299-8","journal-title":"Math. Program."},{"issue":"6","key":"291_CR14","doi-asserted-by":"publisher","first-page":"1477","DOI":"10.1287\/opre.1110.0965","volume":"59","author":"I Contreras","year":"2011","unstructured":"Contreras, I., Cordeau, J.-F., Laporte, G.: Benders decomposition for large-scale uncapacitated hub location. Oper. Res. 59(6), 1477\u20131490 (2011). https:\/\/doi.org\/10.1287\/opre.1110.0965","journal-title":"Oper. Res."},{"key":"291_CR15","doi-asserted-by":"publisher","first-page":"03","DOI":"10.1590\/S0101-74382012005000005","volume":"32","author":"AM Costa","year":"2012","unstructured":"Costa, A.M., Cordeau, J.-F., Gendron, B., Laporte, G.: Accelerating benders decomposition with heuristic master problem solutions. Pesquisa Operacional 32, 03\u201320 (2012). https:\/\/doi.org\/10.1590\/S0101-74382012005000005","journal-title":"Pesquisa Operacional"},{"issue":"3","key":"291_CR16","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/0377-2217(84)90287-X","volume":"16","author":"G Cote","year":"1984","unstructured":"Cote, G., Laughton, M.A.: Large-scale mixed integer programming: benders-type heuristics. Eur. J. Oper. Res. 16(3), 327\u2013333 (1984). https:\/\/doi.org\/10.1016\/0377-2217(84)90287-X","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"291_CR17","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/j.ejor.2016.03.002","volume":"253","author":"M Fischetti","year":"2016","unstructured":"Fischetti, M., Ljubi\u0107, I., Sinnl, M.: Benders decomposition without separability: a computational study for capacitated facility location problems. Eur. J. Oper. Res. 253(3), 557\u2013569 (2016). https:\/\/doi.org\/10.1016\/j.ejor.2016.03.002","journal-title":"Eur. J. Oper. Res."},{"issue":"7","key":"291_CR18","doi-asserted-by":"publisher","first-page":"2146","DOI":"10.1287\/mnsc.2016.2461","volume":"63","author":"M Fischetti","year":"2017","unstructured":"Fischetti, M., Ljubi\u0107, I., Sinnl, M.: Redesigning benders decomposition for large-scale facility location. Manage. Sci. 63(7), 2146\u20132162 (2017). https:\/\/doi.org\/10.1287\/mnsc.2016.2461","journal-title":"Manage. Sci."},{"issue":"1","key":"291_CR19","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s10107-010-0365-7","volume":"124","author":"M Fischetti","year":"2010","unstructured":"Fischetti, M., Salvagnin, D., Zanette, A.: A note on the selection of benders\u2019 cuts. Math. Program. 124(1), 175\u2013182 (2010). https:\/\/doi.org\/10.1007\/s10107-010-0365-7","journal-title":"Math. Program."},{"issue":"3","key":"291_CR20","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1287\/trsc.2013.0463","volume":"48","author":"G Froyland","year":"2014","unstructured":"Froyland, G., Maher, S.J., Wu, C.-L.: The recoverable robust tail assignment problem. Transp. Sci. 48(3), 351\u2013372 (2014). https:\/\/doi.org\/10.1287\/trsc.2013.0463","journal-title":"Transp. Sci."},{"issue":"1","key":"291_CR21","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.ejor.2016.04.058","volume":"255","author":"B Gendron","year":"2016","unstructured":"Gendron, B., Scutell\u00e0, M.G., Garroppo, R.G., Nencioni, G., Tavanti, L.: A branch-and-benders-cut method for nonlinear power design in green wireless local area networks. Eur. J. Oper. Res. 255(1), 151\u2013162 (2016). https:\/\/doi.org\/10.1016\/j.ejor.2016.04.058","journal-title":"Eur. J. Oper. Res."},{"key":"291_CR22","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BF00934810","volume":"10","author":"AM Geoffrion","year":"1972","unstructured":"Geoffrion, A.M.: Generalized benders decomposition. J. Optim. Theory Appl. 10, 237\u2013260 (1972). https:\/\/doi.org\/10.1007\/BF00934810","journal-title":"J. Optim. Theory Appl."},{"issue":"5","key":"291_CR23","doi-asserted-by":"publisher","first-page":"822","DOI":"10.1287\/mnsc.20.5.822","volume":"20","author":"AM Geoffrion","year":"1974","unstructured":"Geoffrion, A.M., Graves, G.W.: Multicommodity distribution system design by benders decomposition. Manage. Sci. 20(5), 822\u2013844 (1974). https:\/\/doi.org\/10.1287\/mnsc.20.5.822","journal-title":"Manage. Sci."},{"key":"291_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-020-00194-3","author":"A Gleixner","year":"2021","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., Shinano, Y.: Miplib 2017: data-driven compilation of the 6th mixed-integer programming library. Math. Program. Comput. (2021). https:\/\/doi.org\/10.1007\/s12532-020-00194-3","journal-title":"Math. Program. Comput."},{"issue":"3","key":"291_CR25","doi-asserted-by":"publisher","first-page":"1051","DOI":"10.1016\/j.ejor.2023.03.036","volume":"310","author":"L Glomb","year":"2023","unstructured":"Glomb, L., Liers, F., R\u00f6sel, F.: Optimizing integrated aircraft assignment and turnaround handling. Eur. J. Oper. Res. 310(3), 1051\u20131071 (2023). https:\/\/doi.org\/10.1016\/j.ejor.2023.03.036","journal-title":"Eur. J. Oper. Res."},{"key":"291_CR26","doi-asserted-by":"publisher","unstructured":"Glomb, L., Liers, F., R\u00f6sel, F.: A stochastic optimization approach for optimal tail assignment with knowledge-based predictive maintenance. CEAS Aeronaut. J. 1\u201314,(2023). https:\/\/doi.org\/10.1007\/s13272-023-00663-0","DOI":"10.1007\/s13272-023-00663-0"},{"key":"291_CR27","doi-asserted-by":"publisher","unstructured":"Glomb, L., Liers, F., R\u00f6sel, F.: Compare css [Version 1.0.0] (2024). https:\/\/doi.org\/10.5281\/zenodo.16908961","DOI":"10.5281\/zenodo.16908961"},{"issue":"2","key":"291_CR28","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1080\/10556788.2017.1401069","volume":"34","author":"V Grimm","year":"2019","unstructured":"Grimm, V., Kleinert, T., Liers, F., Schmidt, M., Z\u00f6ttl, G.: Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches. Optimization methods and software 34(2), 406\u2013436 (2019). https:\/\/doi.org\/10.1080\/10556788.2017.1401069","journal-title":"Optimization methods and software"},{"key":"291_CR29","unstructured":"Gurobi Optimization, L.: Gurobi optimizer reference manual (2020). http:\/\/www.gurobi.com"},{"issue":"2","key":"291_CR30","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":"291_CR31","doi-asserted-by":"publisher","DOI":"10.1016\/j.eneco.2020.104879","volume":"92","author":"M Ambrosius","year":"2020","unstructured":"Ambrosius, M., Grimm, V., Kleinert, T., Liers, F., Schmidt, M., Z\u00f6ttl, G.: Endogenous price zones and investment incentives in electricity markets: an application of multilevel optimization with graph partitioning. Energy Economics 92, 104879 (2020). https:\/\/doi.org\/10.1016\/j.eneco.2020.104879","journal-title":"Energy Economics"},{"issue":"3","key":"291_CR32","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1287\/opre.29.3.464","volume":"29","author":"TL Magnanti","year":"1981","unstructured":"Magnanti, T.L., Wong, R.T.: Accelerating benders decomposition: algorithmic enhancement and model selection criteria. Oper. Res. 29(3), 464\u2013484 (1981). https:\/\/doi.org\/10.1287\/opre.29.3.464","journal-title":"Oper. Res."},{"issue":"1","key":"291_CR33","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1287\/trsc.2017.0756","volume":"53","author":"A Maheo","year":"2019","unstructured":"Maheo, A., Kilby, P., Van Hentenryck, P.: Benders decomposition for the design of a hub and shuttle public transit system. Transp. Sci. 53(1), 77\u201388 (2019). https:\/\/doi.org\/10.1287\/trsc.2017.0756","journal-title":"Transp. Sci."},{"key":"291_CR34","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijepes.2020.106030","volume":"120","author":"S Mansouri","year":"2020","unstructured":"Mansouri, S., Ahmarinejad, A., Ansarian, M., Javadi, M., Catalao, J.: Stochastic planning and operation of energy hubs considering demand response programs using benders decomposition approach. International Journal of Electrical Power & Energy Systems 120, 106030 (2020). https:\/\/doi.org\/10.1016\/j.ijepes.2020.106030","journal-title":"International Journal of Electrical Power & Energy Systems"},{"issue":"3","key":"291_CR35","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1287\/mnsc.24.3.312","volume":"24","author":"D McDaniel","year":"1977","unstructured":"McDaniel, D., Devine, M.: A modified benders\u2019 partitioning algorithm for mixed integer programming. Manage. Sci. 24(3), 312\u2013319 (1977). https:\/\/doi.org\/10.1287\/mnsc.24.3.312","journal-title":"Manage. Sci."},{"issue":"1","key":"291_CR36","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1109\/TPWRS.2015.2409198","volume":"31","author":"A Nasri","year":"2015","unstructured":"Nasri, A., Kazempour, S.J., Conejo, A.J., Ghandhari, M.: Network-constrained ac unit commitment under uncertainty: a benders\u2019 decomposition approach. IEEE Trans. Power Syst. 31(1), 412\u2013422 (2015). https:\/\/doi.org\/10.1109\/TPWRS.2015.2409198","journal-title":"IEEE Trans. Power Syst."},{"issue":"4","key":"291_CR37","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1016\/j.orl.2008.01.005","volume":"36","author":"N Papadakos","year":"2008","unstructured":"Papadakos, N.: Practical enhancements to the magnanti-wong method. Oper. Res. Lett. 36(4), 444\u2013449 (2008). https:\/\/doi.org\/10.1016\/j.orl.2008.01.005","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"291_CR38","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.ejor.2008.10.033","volume":"199","author":"CA Poojari","year":"2009","unstructured":"Poojari, C.A., Beasley, J.E.: Improving benders decomposition using a genetic algorithm. Eur. J. Oper. Res. 199(1), 89\u201397 (2009). https:\/\/doi.org\/10.1016\/j.ejor.2008.10.033","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"291_CR39","doi-asserted-by":"publisher","first-page":"1651","DOI":"10.1109\/TWC.2013.022113.120470","volume":"12","author":"LP Qian","year":"2013","unstructured":"Qian, L.P., Zhang, Y.J.A., Wu, Y., Chen, J.: Joint base station association and power control via benders\u2019 decomposition. IEEE Trans. Wireless Commun. 12(4), 1651\u20131665 (2013). https:\/\/doi.org\/10.1109\/TWC.2013.022113.120470","journal-title":"IEEE Trans. Wireless Commun."},{"issue":"3","key":"291_CR40","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1016\/j.ejor.2016.12.005","volume":"259","author":"R Rahmaniani","year":"2017","unstructured":"Rahmaniani, R., Crainic, T.G., Gendreau, M., Rei, W.: The benders decomposition algorithm: a literature review. Eur. J. Oper. Res. 259(3), 801\u2013817 (2017). https:\/\/doi.org\/10.1016\/j.ejor.2016.12.005","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"291_CR41","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1137\/17M1128204","volume":"28","author":"R Rahmaniani","year":"2018","unstructured":"Rahmaniani, R., Crainic, T.G., Gendreau, M., Rei, W.: Accelerating the benders decomposition method: application to stochastic network design problems. SIAM J. Optim. 28(1), 875\u2013903 (2018). https:\/\/doi.org\/10.1137\/17M1128204","journal-title":"SIAM J. Optim."},{"issue":"2","key":"291_CR42","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1287\/ijoc.1080.0296","volume":"21","author":"W Rei","year":"2009","unstructured":"Rei, W., Cordeau, J.-F., Gendreau, M., Soriano, P.: Accelerating benders decomposition by local branching. INFORMS J. Comput. 21(2), 333\u2013345 (2009). https:\/\/doi.org\/10.1287\/ijoc.1080.0296","journal-title":"INFORMS J. Comput."},{"issue":"6","key":"291_CR43","doi-asserted-by":"publisher","first-page":"6627","DOI":"10.1016\/j.eswa.2010.11.075","volume":"38","author":"GK Saharidis","year":"2011","unstructured":"Saharidis, G.K., Boile, M., Theofanis, S.: Initialization of the benders master problem using valid inequalities applied to fixed-charge network problems. Expert Syst. Appl. 38(6), 6627\u20136636 (2011). https:\/\/doi.org\/10.1016\/j.eswa.2010.11.075","journal-title":"Expert Syst. Appl."},{"issue":"2","key":"291_CR44","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1111\/j.1475-3995.2009.00706.x","volume":"17","author":"GK Saharidis","year":"2010","unstructured":"Saharidis, G.K., Minoux, M., Ierapetritou, M.G.: Accelerating benders method using covering cut bundle generation. Int. Trans. Oper. Res. 17(2), 221\u2013237 (2010). https:\/\/doi.org\/10.1111\/j.1475-3995.2009.00706.x","journal-title":"Int. Trans. Oper. Res."},{"issue":"1","key":"291_CR45","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.ejor.2004.01.046","volume":"167","author":"T Santoso","year":"2005","unstructured":"Santoso, T., Ahmed, S., Goetschalckx, M., Shapiro, A.: A stochastic programming approach for supply chain network design under uncertainty. Eur. J. Oper. Res. 167(1), 96\u2013115 (2005). https:\/\/doi.org\/10.1016\/j.ejor.2004.01.046","journal-title":"Eur. J. Oper. Res."},{"key":"291_CR46","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10479-011-0883-6","volume":"210","author":"HD Sherali","year":"2013","unstructured":"Sherali, H.D., Lunday, B.J.: On generating maximal nondominated benders cuts. Ann. Oper. Res. 210, 57\u201372 (2013). https:\/\/doi.org\/10.1007\/s10479-011-0883-6","journal-title":"Ann. Oper. Res."},{"key":"291_CR47","unstructured":"Stursberg, P.M.: On the mathematics of energy system optimization [Doctoral dissertation, Technische Universit\u00e4t M\u00fcnchen] (2019)"},{"issue":"1","key":"291_CR48","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1287\/opre.34.1.145","volume":"34","author":"TJ Van Roy","year":"1986","unstructured":"Van Roy, T.J.: A cross decomposition algorithm for capacitated facility location. Oper. Res. 34(1), 145\u2013163 (1986). https:\/\/doi.org\/10.1287\/opre.34.1.145","journal-title":"Oper. Res."},{"issue":"2","key":"291_CR49","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BF01194335","volume":"44","author":"P Wentges","year":"1996","unstructured":"Wentges, P.: Accelerating benders\u2019 decomposition for the capacitated facility location problem. Math. Methods Oper. Res. 44(2), 267\u2013290 (1996). https:\/\/doi.org\/10.1007\/BF01194335","journal-title":"Math. Methods Oper. Res."},{"issue":"3","key":"291_CR50","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s12667-010-0015-4","volume":"1","author":"L Wu","year":"2010","unstructured":"Wu, L., Shahidehpour, M.: Accelerating the benders decomposition for network-constrained unit commitment problems. Energy Systems 1(3), 339\u2013376 (2010). https:\/\/doi.org\/10.1007\/s12667-010-0015-4","journal-title":"Energy Systems"},{"key":"291_CR51","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10479-011-0974-4","volume":"210","author":"F You","year":"2013","unstructured":"You, F., Grossmann, I.E.: Multicut benders decomposition algorithm for process supply chain planning under uncertainty. Ann. Oper. Res. 210, 191\u2013211 (2013). https:\/\/doi.org\/10.1007\/s10479-011-0974-4","journal-title":"Ann. Oper. Res."}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-025-00291-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12532-025-00291-1","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-025-00291-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T12:02:15Z","timestamp":1772625735000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12532-025-00291-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,15]]},"references-count":51,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["291"],"URL":"https:\/\/doi.org\/10.1007\/s12532-025-00291-1","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,15]]},"assertion":[{"value":"26 September 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 August 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 October 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 declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}},{"value":"The full code was made available for review. We remark that a set of packages were used in this study, that were either open source or available for academic use. Specific references are included in this published article.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}}]}}