{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:57:37Z","timestamp":1781305057963,"version":"3.54.1"},"publisher-location":"Cham","reference-count":30,"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_30","type":"book-chapter","created":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:34:37Z","timestamp":1781303677000},"page":"457-473","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Structure-Preserving Symmetry Presolving for\u00a0Mixed-Binary Linear Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-2945-4704","authenticated-orcid":false,"given":"Annika","family":"J\u00e4ger","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0947-7193","authenticated-orcid":false,"given":"Marc E.","family":"Pfetsch","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,13]]},"reference":[{"key":"30_CR1","doi-asserted-by":"publisher","unstructured":"Anders, M., Brenner, S., Rattan, G.: Satsuma: structure-based symmetry breaking in SAT. In: Chakraborty, S., Jiang, J.H.R. (eds.) 27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0305, pp. 4:1\u20134:23. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2024). https:\/\/doi.org\/10.4230\/LIPIcs.SAT.2024.4","DOI":"10.4230\/LIPIcs.SAT.2024.4"},{"key":"30_CR2","doi-asserted-by":"publisher","unstructured":"Anders, M., Schweitzer, P., Stie\u00df, J.: Engineering a preprocessor for symmetry detection. In: Georgiadis, L. (ed.) 21st International Symposium on Experimental Algorithms (SEA 2023). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0265, pp. 1:1\u20131:21. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2023). https:\/\/doi.org\/10.4230\/LIPIcs.SEA.2023.1","DOI":"10.4230\/LIPIcs.SEA.2023.1"},{"key":"30_CR3","doi-asserted-by":"publisher","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","DOI":"10.1007\/s10107-019-01457-1"},{"key":"30_CR4","unstructured":"Instances for CliSAT \u2013 an efficient state-of-the-art exact algorithm for the maximum clique problem. https:\/\/github.com\/psanse\/CliSAT"},{"key":"30_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-319-40970-2_8","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2016","author":"J Devriendt","year":"2016","unstructured":"Devriendt, J., Bogaerts, B., Bruynooghe, M., Denecker, M.: Improved static symmetry breaking for SAT. In: Creignou, N., Le Berre, D. (eds.) SAT 2016. LNCS, vol. 9710, pp. 104\u2013122. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40970-2_8"},{"key":"30_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-540-73556-4_17","volume-title":"Combinatorial Optimization and Applications","author":"EJ Friedman","year":"2007","unstructured":"Friedman, E.J.: Fundamental domains for integer programs with symmetries. In: Dress, A., Xu, Y., Zhu, B. (eds.) COCOA 2007. LNCS, vol. 4616, pp. 146\u2013153. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73556-4_17"},{"key":"30_CR7","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1016\/j.dam.2020.03.002","volume":"283","author":"C Hojny","year":"2020","unstructured":"Hojny, C.: Packing, partitioning, and covering symresacks. Discret. Appl. Math. 283, 689\u2013717 (2020). https:\/\/doi.org\/10.1016\/j.dam.2020.03.002","journal-title":"Discret. Appl. Math."},{"key":"30_CR8","unstructured":"Hojny, C., et al.: The SCIP Optimization Suite 10.0. Technical report, Optimization Online (2025). https:\/\/optimization-online.org\/2025\/11\/the-scip-optimization-suite-10-0\/"},{"key":"30_CR9","doi-asserted-by":"publisher","unstructured":"Hojny, C., Pfetsch, M.E.: Polytopes associated with symmetry handling. Math. Program. 175, 197\u2013240 (2019). https:\/\/doi.org\/10.1007\/s10107-018-1239-7","DOI":"10.1007\/s10107-018-1239-7"},{"key":"30_CR10","unstructured":"Hojny, C., Pfetsch, M.E., Verschae, J.: The impact of symmetry handling for the stable set problem via Schreier-Sims cuts. Technical report 2311.06085, arXiv (2023). https:\/\/arxiv.org\/abs\/2311.06085"},{"key":"30_CR11","unstructured":"J\u00e4ger, A., Pfetsch, M.E.: Structure-preserving symmetry presolving for mixed-binary linear problems. Preprint, Optimization Online (2026). https:\/\/optimization-online.org\/?p=32590"},{"key":"30_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-642-21311-3_11","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"T Januschowski","year":"2011","unstructured":"Januschowski, T., Pfetsch, M.E.: Branch-cut-and-propagate for the maximum k-colorable subgraph problem with symmetry. In: Achterberg, T., Beck, J.C. (eds.) CPAIOR 2011. LNCS, vol. 6697, pp. 99\u2013116. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21311-3_11"},{"key":"30_CR13","unstructured":"Junttila, T., Kaski, P.: bliss: a tool for computing automorphism groups and canonical labelings of graphs (2012). https:\/\/users.aalto.fi\/~tjunttil\/bliss\/"},{"issue":"4","key":"30_CR14","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."},{"issue":"1","key":"30_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-006-0081-5","volume":"114","author":"V Kaibel","year":"2008","unstructured":"Kaibel, V., Pfetsch, M.E.: Packing and partitioning orbitopes. Math. Program. 114(1), 1\u201336 (2008). https:\/\/doi.org\/10.1007\/s10107-006-0081-5","journal-title":"Math. Program."},{"issue":"4","key":"30_CR16","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1016\/j.jcss.2005.05.002","volume":"71","author":"SG Kolliopoulos","year":"2005","unstructured":"Kolliopoulos, S.G., Young, N.E.: Approximation algorithms for covering\/packing integer programs. J. Comput. Syst. Sci. 71(4), 495\u2013505 (2005). https:\/\/doi.org\/10.1016\/j.jcss.2005.05.002","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"30_CR17","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s10898-013-0106-6","volume":"60","author":"L Liberti","year":"2013","unstructured":"Liberti, L., Ostrowski, J.: Stabilizer-based symmetry breaking constraints for mathematical programs. J. Global Optim. 60(2), 183\u2013194 (2013). https:\/\/doi.org\/10.1007\/s10898-013-0106-6","journal-title":"J. Global Optim."},{"issue":"2","key":"30_CR18","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1287\/ijoo.2019.0044","volume":"3","author":"J Linderoth","year":"2021","unstructured":"Linderoth, J., N\u00fa\u00f1ez Ares, J., Ostrowski, J., Rossi, F., Smriglio, S.: Orbital conflict: cutting planes for symmetric integer programs. INFORMS J. Optim. 3(2), 139\u2013153 (2021). https:\/\/doi.org\/10.1287\/ijoo.2019.0044","journal-title":"INFORMS J. Optim."},{"key":"30_CR19","doi-asserted-by":"crossref","unstructured":"Margot, F.: Symmetry in integer linear programming. In: J\u00fcnger, M., et al. (eds.) 50 Years of Integer Programming, pp. 647\u2013686. Springer (2010)","DOI":"10.1007\/978-3-540-68279-0_17"},{"issue":"1","key":"30_CR20","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10107-002-0358-2","volume":"94","author":"F Margot","year":"2002","unstructured":"Margot, F.: Pruning by isomorphism in branch-and-cut. Math. Program. 94(1), 71\u201390 (2002). https:\/\/doi.org\/10.1007\/s10107-002-0358-2","journal-title":"Math. Program."},{"issue":"1\u20133","key":"30_CR21","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-003-0394-6","volume":"98","author":"F Margot","year":"2003","unstructured":"Margot, F.: Exploiting orbits in symmetric ILP. Math. Program. 98(1\u20133), 3\u201321 (2003). https:\/\/doi.org\/10.1007\/s10107-003-0394-6","journal-title":"Math. Program."},{"issue":"2","key":"30_CR22","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s10107-002-0316-z","volume":"94","author":"F Margot","year":"2003","unstructured":"Margot, F.: Small covering designs by branch-and-cut. Math. Program. 94(2), 207\u2013220 (2003). https:\/\/doi.org\/10.1007\/s10107-002-0316-z","journal-title":"Math. Program."},{"key":"30_CR23","unstructured":"Ostrowski, J.: Symmetry in Integer Programming. Ph.D. thesis, Lehigh University (2008)"},{"issue":"1","key":"30_CR24","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s10107-014-0812-y","volume":"150","author":"J Ostrowski","year":"2014","unstructured":"Ostrowski, J., Anjos, M.F., Vannelli, A.: Modified orbital branching for structured symmetry with an application to unit commitment. Math. Program. 150(1), 99\u2013129 (2014). https:\/\/doi.org\/10.1007\/s10107-014-0812-y","journal-title":"Math. Program."},{"issue":"1","key":"30_CR25","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":"30_CR26","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s12532-018-0140-y","volume":"11","author":"ME Pfetsch","year":"2018","unstructured":"Pfetsch, M.E., Rehn, T.: A computational comparison of symmetry handling methods for mixed integer programs. Math. Program. Comput. 11(1), 37\u201393 (2018). https:\/\/doi.org\/10.1007\/s12532-018-0140-y","journal-title":"Math. Program. Comput."},{"key":"30_CR27","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"},{"issue":"3","key":"30_CR28","doi-asserted-by":"publisher","first-page":"1008","DOI":"10.1016\/j.ejor.2022.10.028","volume":"307","author":"P San Segundo","year":"2023","unstructured":"San Segundo, P., Furini, F., \u00c1lvarez, D., Pardalos, P.M.: CliSAT: a new exact algorithm for hard maximum clique problems. Eur. J. Oper. Res. 307(3), 1008\u20131025 (2023). https:\/\/doi.org\/10.1016\/j.ejor.2022.10.028","journal-title":"Eur. J. Oper. Res."},{"key":"30_CR29","doi-asserted-by":"crossref","unstructured":"Verschae, J., Villagra, M., von Niederh\u00e4usern, L.: On the geometry of symmetry breaking inequalities. In: Singh, M., Williamson, D.P. (eds.) Integer Programming and Combinatorial Optimization, pp. 73\u201388. Springer, Cham (2021)","DOI":"10.1007\/978-3-030-73879-2_6"},{"issue":"2","key":"30_CR30","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/s10107-022-01819-2","volume":"197","author":"J Verschae","year":"2023","unstructured":"Verschae, J., Villagra, M., von Niederh\u00e4usern, L.: On the geometry of symmetry breaking inequalities. Math. Program. 197(2), 693\u2013719 (2023). https:\/\/doi.org\/10.1007\/s10107-022-01819-2","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_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:34:40Z","timestamp":1781303680000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-28691-8_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032286901","9783032286918"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-28691-8_30","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 interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"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"}}]}}