{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:57:32Z","timestamp":1781305052992,"version":"3.54.1"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032286901","type":"print"},{"value":"9783032286918","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-28691-8_29","type":"book-chapter","created":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:34:15Z","timestamp":1781303655000},"page":"441-456","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Framework for\u00a0Handling and\u00a0Exploiting Symmetry in\u00a0Benders Decomposition"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5324-8996","authenticated-orcid":false,"given":"Christopher","family":"Hojny","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-4435-9508","authenticated-orcid":false,"given":"C\u00e9dric","family":"Roy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,13]]},"reference":[{"issue":"4","key":"29_CR1","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)","journal-title":"Oper. Res."},{"issue":"2","key":"29_CR2","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1016\/j.ejor.2016.11.001","volume":"259","author":"S Akpinar","year":"2017","unstructured":"Akpinar, S., Elmi, A., Bekta\u015f, T.: Combinatorial Benders cuts for assembly line balancing problems with setups. Eur. J. Oper. Res. 259(2), 527\u2013537 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"29_CR3","doi-asserted-by":"publisher","unstructured":"Anders, M., Schweitzer, P., Stie\u00df, J.: Engineering a preprocessor for symmetry detection (2023). https:\/\/doi.org\/10.48550\/arXiv.2302.06351","DOI":"10.48550\/arXiv.2302.06351"},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"JF Benders","year":"1962","unstructured":"Benders, J.F.: Partitioning procedures for solving mixed-variables programming problems. Numer. Math. 4, 238\u2013252 (1962)","journal-title":"Numer. Math."},{"key":"29_CR5","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10107-019-01457-1","volume":"186","author":"P Bendotti","year":"2021","unstructured":"Bendotti, P., Fouilhoux, P., Rottner, C.: Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem. Math. Program. 186, 337\u2013372 (2021). https:\/\/doi.org\/10.1007\/s10107-019-01457-1","journal-title":"Math. Program."},{"key":"29_CR6","unstructured":"Bolusani, S., et al.: The SCIP optimization suite 9.0 (2024)"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Bonami, P., Salvagnin, D., Tramontani, A.: Implementing automatic benders decomposition in a modern MIP solver. In: Bienstock, D., Zambelli, G. (eds.) Integer Programming and Combinatorial Optimization, pp. 78\u201390 (2020)","DOI":"10.1007\/978-3-030-45771-6_7"},{"issue":"3","key":"29_CR8","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1287\/ijoc.2023.1280","volume":"35","author":"M Daryalal","year":"2023","unstructured":"Daryalal, M., Pouya, H., DeSantis, M.A.: Network migration problem: a hybrid logic-based Benders decomposition approach. INFORMS J. Comput. 35(3), 593\u2013613 (2023). https:\/\/doi.org\/10.1287\/ijoc.2023.1280","journal-title":"INFORMS J. Comput."},{"key":"29_CR9","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/j.cor.2016.09.009","volume":"78","author":"M Delorme","year":"2017","unstructured":"Delorme, M., Iori, M., Martello, S.: Logic based Benders\u2019 decomposition for orthogonal stock cutting problems. Comput. Oper. Res. 78, 290\u2013298 (2017). https:\/\/doi.org\/10.1016\/j.cor.2016.09.009","journal-title":"Comput. Oper. Res."},{"key":"29_CR10","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s10107-024-02102-2","volume":"212","author":"J van Doornmalen","year":"2025","unstructured":"van Doornmalen, J., Hojny, C.: A unified framework for symmetry handling. Math. Program. 212, 217\u2013271 (2025)","journal-title":"Math. Program."},{"issue":"3","key":"29_CR11","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1287\/ijoc.1110.0458","volume":"24","author":"MM Fazel-Zarandi","year":"2012","unstructured":"Fazel-Zarandi, M.M., Beck, J.C.: Using logic-based Benders decomposition to solve the capacity- and distance-constrained plant location problem. INFORMS J. Comput. 24(3), 387\u2013398 (2012)","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"29_CR12","doi-asserted-by":"publisher","first-page":"1551","DOI":"10.1287\/ijoc.2020.1036","volume":"33","author":"C Guo","year":"2021","unstructured":"Guo, C., Bodur, M., Aleman, D.M., Urbach, D.R.: Logic-based Benders decomposition and binary decision diagram based approaches for stochastic distributed operating room scheduling. INFORMS J. Comput. 33(4), 1551\u20131569 (2021). https:\/\/doi.org\/10.1287\/ijoc.2020.1036","journal-title":"INFORMS J. Comput."},{"key":"29_CR13","doi-asserted-by":"publisher","unstructured":"Han, P., et al.: Integrated optimization of train makeup problem and resource scheduling in railway marshalling yards: a hybrid MILP-CP approach with logic-based Benders decomposition. Transp. Res. Part B: Methodol. 200, 103306 (2025). https:\/\/doi.org\/10.1016\/j.trb.2025.103306","DOI":"10.1016\/j.trb.2025.103306"},{"issue":"2","key":"29_CR14","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1287\/trsc.2018.0830","volume":"53","author":"A Heching","year":"2019","unstructured":"Heching, A., Hooker, J.N., Kimura, R.: A logic-based Benders approach to home healthcare delivery. Transp. Sci. 53(2), 510\u2013522 (2019)","journal-title":"Transp. Sci."},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"Hojny, C.: Detecting and handling reflection symmetries in mixed-integer (nonlinear) programming and beyond. Math. Program. Comput. 1\u201348 (2025)","DOI":"10.1007\/s12532-025-00289-9"},{"key":"29_CR16","doi-asserted-by":"publisher","unstructured":"Hojny, C., Roy, C.: Supplementary material for the article \u201ca framework for handling and exploiting symmetry in benders decomposition\u201d (2026). https:\/\/doi.org\/10.5281\/zenodo.19068205","DOI":"10.5281\/zenodo.19068205"},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"Hooker, J.: Logic-Based Benders Decomposition. Synthesis Lectures on Operations Research and Applications, 1st edn. Springer, Cham (2024)","DOI":"10.1007\/978-3-031-45039-6"},{"issue":"1","key":"29_CR18","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10107-003-0375-9","volume":"96","author":"JN Hooker","year":"2003","unstructured":"Hooker, J.N., Ottosson, G.: Logic-based Benders decomposition. Math. Program. 96(1), 33\u201360 (2003)","journal-title":"Math. Program."},{"issue":"4","key":"29_CR19","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/j.disopt.2011.07.001","volume":"8","author":"V Kaibel","year":"2011","unstructured":"Kaibel, V., Peinhardt, M., Pfetsch, M.E.: Orbitopal fixing. Discret. Optim. 8(4), 595\u2013610 (2011). https:\/\/doi.org\/10.1016\/j.disopt.2011.07.001","journal-title":"Discret. Optim."},{"key":"29_CR20","doi-asserted-by":"publisher","first-page":"107197","DOI":"10.1016\/j.orl.2024.107197","volume":"57","author":"A Khajavirad","year":"2024","unstructured":"Khajavirad, A.: The circle packing problem: a theoretical comparison of various convexification techniques. Oper. Res. Lett. 57, 107197 (2024)","journal-title":"Oper. Res. Lett."},{"key":"29_CR21","unstructured":"Lehmann, A., Kleiminger, W., Invernizzi, H., Gautschi, A.: Accelerated benders decomposition for variable-height transport packaging optimisation. arXiv preprint arXiv:2308.01104 (2023)"},{"issue":"1","key":"29_CR22","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10107-010-0351-0","volume":"131","author":"L Liberti","year":"2012","unstructured":"Liberti, L.: Reformulations in mathematical programming: automatic symmetry detection and exploitation. Math. Program. 131(1), 273\u2013304 (2012)","journal-title":"Math. Program."},{"key":"29_CR23","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s10898-013-0106-6","volume":"60","author":"L Liberti","year":"2014","unstructured":"Liberti, L., Ostrowski, J.: Stabilizer-based symmetry breaking constraints for mathematical programs. J. Global Optim. 60, 183\u2013194 (2014)","journal-title":"J. Global Optim."},{"issue":"2","key":"29_CR24","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1016\/j.ejor.2020.08.037","volume":"290","author":"SJ Maher","year":"2021","unstructured":"Maher, S.J.: Implementing the branch-and-cut approach for a general purpose Benders\u2019 decomposition framework. Eur. J. Oper. Res. 290(2), 479\u2013498 (2021). https:\/\/doi.org\/10.1016\/j.ejor.2020.08.037","journal-title":"Eur. J. Oper. Res."},{"key":"29_CR25","doi-asserted-by":"crossref","unstructured":"Margot, F.: Symmetry in integer linear programming. 50 years of integer programming 1958\u20132008: from the early years to the state-of-the-art, pp. 647\u2013686 (2009)","DOI":"10.1007\/978-3-540-68279-0_17"},{"key":"29_CR26","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.jsc.2013.09.003","volume":"60","author":"BD McKay","year":"2014","unstructured":"McKay, B.D., Piperno, A.: Practical graph isomorphism, II. J. Symb. Comput. 60, 94\u2013112 (2014). https:\/\/doi.org\/10.1016\/j.jsc.2013.09.003","journal-title":"J. Symb. Comput."},{"issue":"1","key":"29_CR27","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s10107-009-0273-x","volume":"126","author":"J Ostrowski","year":"2011","unstructured":"Ostrowski, J., Linderoth, J., Rossi, F., Smriglio, S.: Orbital branching. Math. Program. 126(1), 147\u2013178 (2011). https:\/\/doi.org\/10.1007\/s10107-009-0273-x","journal-title":"Math. Program."},{"issue":"1","key":"29_CR28","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s12532-018-0140-y","volume":"11","author":"ME Pfetsch","year":"2019","unstructured":"Pfetsch, M.E., Rehn, T.: A computational comparison of symmetry handling methods for mixed integer programs. Math. Program. Comput. 11(1), 37\u201393 (2019). https:\/\/doi.org\/10.1007\/s12532-018-0140-y","journal-title":"Math. Program. Comput."},{"issue":"1","key":"29_CR29","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1287\/ijoc.1060.0181","volume":"19","author":"D Pisinger","year":"2007","unstructured":"Pisinger, D., Sigurd, M.: Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem. INFORMS J. Comput. 19(1), 36\u201351 (2007)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"29_CR30","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1016\/j.ejor.2016.06.015","volume":"255","author":"A Riise","year":"2016","unstructured":"Riise, A., Mannino, C., Lamorgese, L.: Recursive logic-based Benders\u2019 decomposition for multi-mode outpatient scheduling. Eur. J. Oper. Res. 255(3), 719\u2013728 (2016)","journal-title":"Eur. J. Oper. Res."},{"key":"29_CR31","unstructured":"Salvagnin, D.: A dominance procedure for integer programming. Master\u2019s thesis, University of Padova, Padova, Italy (2005)"},{"key":"29_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/978-3-319-93031-2_37","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"D Salvagnin","year":"2018","unstructured":"Salvagnin, D.: Symmetry breaking inequalities from the Schreier-sims table. In: van Hoeve, W.-J. (ed.) CPAIOR 2018. LNCS, vol. 10848, pp. 521\u2013529. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93031-2_37"},{"key":"29_CR33","unstructured":"SAS Institute Inc.: SAS Programming Documentation. https:\/\/documentation.sas.com\/doc\/en\/pgmsascdc\/v_068\/casmopt\/casmopt_benders_overview.htm"},{"issue":"1","key":"29_CR34","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1287\/ijoc.2015.0666","volume":"28","author":"TT Tran","year":"2016","unstructured":"Tran, T.T., Araujo, A., Beck, J.C.: Decomposition methods for the parallel machine scheduling problem with setups. INFORMS J. Comput. 28(1), 83\u201395 (2016)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"29_CR35","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1016\/j.ejor.2022.10.044","volume":"307","author":"D Van Bulck","year":"2023","unstructured":"Van Bulck, D., Goossens, D.: A traditional Benders\u2019 approach to sports timetabling. Eur. J. Oper. Res. 307(2), 813\u2013826 (2023)","journal-title":"Eur. J. Oper. Res."},{"key":"29_CR36","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A W\u00e4chter","year":"2006","unstructured":"W\u00e4chter, A., Biegler, L.T.: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Program. 106, 25\u201357 (2006). https:\/\/doi.org\/10.1007\/s10107-004-0559-y","journal-title":"Math. Program."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-28691-8_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:34:19Z","timestamp":1781303659000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-28691-8_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032286901","9783032286918"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-28691-8_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"13 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interest to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of interest"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Padua","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/events.math.unipd.it\/ipco2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}