{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T09:07:19Z","timestamp":1776071239351,"version":"3.50.1"},"reference-count":31,"publisher":"Institute for Operations Research and the Management Sciences (INFORMS)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["INFORMS Journal on Computing"],"published-print":{"date-parts":[[2026,3]]},"abstract":"<jats:p>The recent performance improvements in mixed-integer programming (MIP) have been accompanied by a significantly increased complexity of the codes of MIP solvers, which poses challenges in fixing implementation errors. In this paper, we introduce MIP-DD, a solver-independent tool, which to the best of our knowledge is the first open-source delta debugger for MIP. Delta debugging is a hypothesis-trial-result approach to isolate the cause of a solver failure. MIP-DD simplifies MIP instances while maintaining the undesired behavior. Preliminary versions already supported and motivated fixes for many bugs in the SCIP releases 8.0.1 to 8.1.1. In these versions, MIP-DD successfully contributed to 24 out of all 51 documented MIP-related bugfixes even for some long-known issues. In selected case studies we highlight that instances triggering fundamental bugs in SCIP can typically be reduced to a few variables and constraints in less than an hour. This makes it significantly easier to manually trace and check the solution process on the resulting simplified instances. A promising future application of MIP-DD is the analysis of performance bottlenecks, which could very well benefit from simple adversarial instances.<\/jats:p>\n                  <jats:p>History: Accepted by Ted Ralphs, Area Editor for Software Tools.<\/jats:p>\n                  <jats:p>Funding: This work was partially supported by the German Research Foundation [Grant RA 1033\/3-1] and the German Federal Ministry of Education and Research [Grant 05M20ZBM].<\/jats:p>\n                  <jats:p>Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https:\/\/pubsonline.informs.org\/doi\/suppl\/10.1287\/ijoc.2024.0844 ) as well as from the IJOC GitHub software repository ( https:\/\/github.com\/INFORMSJoC\/2024.0844 ). The complete IJOC Software and Data Repository is available at https:\/\/informsjoc.github.io\/ .<\/jats:p>","DOI":"10.1287\/ijoc.2024.0844","type":"journal-article","created":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T12:12:16Z","timestamp":1744287136000},"page":"414-423","source":"Crossref","is-referenced-by-count":0,"title":["MIP-DD: Delta Debugging for Mixed-Integer Programming Solvers"],"prefix":"10.1287","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1065-1651","authenticated-orcid":false,"given":"Alexander","family":"Hoen","sequence":"first","affiliation":[{"name":"Zuse Institute Berlin, 14195 Berlin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-5577-9992","authenticated-orcid":false,"given":"Dominik","family":"Kamp","sequence":"additional","affiliation":[{"name":"University of Bayreuth, 95440 Bayreuth, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0391-5903","authenticated-orcid":false,"given":"Ambros","family":"Gleixner","sequence":"additional","affiliation":[{"name":"Zuse Institute Berlin, 14195 Berlin, Germany; and HTW Berlin, 10313 Berlin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"109","reference":[{"key":"B1","unstructured":"Achterberg T (2007) Constraint integer programming. PhD thesis, Technische Universit\u00e4t Berlin, Berlin."},{"key":"B3","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2018.0857"},{"key":"B4","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-002-0363-5"},{"key":"B5","unstructured":"Bolusani S, Besan\u00e7on M, Bestuzheva K, Chmiela A, Dion\u00edsio J, Donkiewicz T, van Doornmalen J, et al. (2024) The SCIP optimization suite 9.0. Preprint, submitted February 27, https:\/\/arxiv.org\/abs\/2402.17702."},{"key":"B6","doi-asserted-by":"crossref","unstructured":"Brummayer R, Biere A (2009) Fuzzing and delta-debugging SMT solvers. Dutertre B, Strichman O, eds.\n                      SMT \u201809 Proc. 7th Internat. Workshop Satisfiability Modulo Theories\n                      (Association for Computing Machinery, New York), 1\u20135.","DOI":"10.1145\/1670412.1670413"},{"key":"B7","doi-asserted-by":"crossref","unstructured":"Brummayer R, Lonsing F, Biere A (2010) Automated testing and debugging of SAT and QBF solvers. Strichman O, Szeider S, eds.\n                      Theory Appl. Satisfiability Testing SAT 2010\n                      (Springer, Berlin), 44\u201357.","DOI":"10.1007\/978-3-642-14186-7_6"},{"key":"B8","doi-asserted-by":"crossref","unstructured":"Cheung KKH, Gleixner A, Steffy DE (2017) Verifying integer programming results. Eisenbrand F, Koenemann J, eds.\n                      Integer Programming Combin. Optim. 19th Internat. Conf. IPCO 2017\n                      (Springer, Cham, Switzerland), 148\u2013160.","DOI":"10.1007\/978-3-319-59250-3_13"},{"key":"B9","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.9.2.164"},{"key":"B10","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.3.2.157"},{"key":"B11","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-013-0055-6"},{"key":"B12","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-021-01749-5"},{"key":"B13","doi-asserted-by":"publisher","DOI":"10.1137\/23M156046X"},{"key":"#cr-split#-B14.1","unstructured":"European Parliament and Council of the European Union (2016) Regulation"},{"key":"#cr-split#-B14.2","unstructured":"(EU) 2016\/679 of the European Parliament and of the Council. Accessed March 24, 2025, https:\/\/data.europa.eu\/eli\/reg\/2016\/679\/oj."},{"key":"B15","unstructured":"Exact SCIP (2024) A development version of SCIP with exact rational arithmetic. https:\/\/github.com\/scipopt\/scip\/tree\/exact-rational."},{"key":"B16","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2.1.61"},{"key":"B17","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2022.0171"},{"key":"B18","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-020-00194-3"},{"key":"B19","doi-asserted-by":"publisher","DOI":"10.1145\/103162.103163"},{"key":"B20","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1958-10224-4"},{"key":"B21","first-page":"269","volume-title":"Recent Advances in Mathematical Programming","author":"Gomory RE","year":"1963"},{"key":"B22","doi-asserted-by":"crossref","unstructured":"Hoen A, Kamp D, Gleixner A (2025) MIP-DD: Delta debugging for mixed integer programming solvers. http:\/\/dx.doi.org\/10.1287\/ijoc.2024.0844.cd, https:\/\/github.com\/INFORMSJoC\/2024.0844.","DOI":"10.1287\/ijoc.2024.0844.cd"},{"key":"B23","doi-asserted-by":"crossref","unstructured":"Kaufmann D, Biere A (2022) Fuzzing and delta debugging and-inverter graph verification tools. Kov\u00e1cs L, Meinke K, eds.\n                      Tests Proofs TAP 2022\n                      (Springer, Cham, Switzerland), 69\u201388.","DOI":"10.1007\/978-3-031-09827-7_5"},{"key":"B24","first-page":"54","author":"Klotz E","year":"2014","journal-title":"INFORMS Tutorials Oper. Res."},{"key":"B25","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejco.2022.100031"},{"key":"B26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68279-0_17"},{"key":"B27","unstructured":"Niemetz A, Biere A (2013) ddSMT: A delta debugger for the SMT-LIB v2 format. Bruttomesso R, Griggio A, eds.\n                      Proc. 11th Internat. Workshop Satisfiability Modulo Theories SMT 2013 Affiliated 16th Internat. Conf. Theory Appl. Satisfiability Testing SAT 2013\n                      , 36\u201345."},{"key":"B28","unstructured":"Paxian T, Biere A (2023) Uncovering and classifying bugs in MaxSAT solvers through fuzzing and delta debugging. J\u00e4rvisalo M, Le Berre D, eds.\n                      Proc. 14th Internat. Workshop Pragmatics SAT Co-Located 26th Internat. Confer. Theory Appl. Satisfiability Testing (SAT 2003)\n                      , 59\u201371."},{"key":"B29","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.6.4.445"},{"key":"B30","unstructured":"Steffy DE (2011) Topics in exact precision mathematical programming. PhD thesis, Georgia Institute of Technology, Atlanta."},{"key":"B31","doi-asserted-by":"crossref","unstructured":"Zeller A (1999) Yesterday, my program worked. Today, it does not. Why? Nierstrasz O, Lemoine M, eds.\n                      Software Engrg. ESEC\/FSE \u201899\n                      (Springer, Berlin), 253\u2013267.","DOI":"10.1007\/3-540-48166-4_16"}],"container-title":["INFORMS Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/pubsonline.informs.org\/doi\/pdf\/10.1287\/ijoc.2024.0844","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T08:25:15Z","timestamp":1776068715000},"score":1,"resource":{"primary":{"URL":"https:\/\/pubsonline.informs.org\/doi\/10.1287\/ijoc.2024.0844"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["10.1287\/ijoc.2024.0844"],"URL":"https:\/\/doi.org\/10.1287\/ijoc.2024.0844","relation":{},"ISSN":["1091-9856","1526-5528"],"issn-type":[{"value":"1091-9856","type":"print"},{"value":"1526-5528","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3]]}}}