{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T16:53:20Z","timestamp":1782924800989,"version":"3.54.5"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031959752","type":"print"},{"value":"9783031959769","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-95976-9_3","type":"book-chapter","created":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T03:53:55Z","timestamp":1751082835000},"page":"35-50","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Analyzing the\u00a0Numerical Correctness of\u00a0Branch-and-Bound Decisions for\u00a0Mixed-Integer Programming"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1065-1651","authenticated-orcid":false,"given":"Alexander","family":"Hoen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0391-5903","authenticated-orcid":false,"given":"Ambros","family":"Gleixner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,6,29]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","unstructured":"Achterberg, T.: Constraint Integer Programming. Ph.D. thesis (2007). https:\/\/doi.org\/10.14279\/depositonce-1634","DOI":"10.14279\/depositonce-1634"},{"key":"3_CR2","doi-asserted-by":"publisher","unstructured":"Achterberg, T., Bixby, R., Gu, Z., Rothberg, E., Weninger, D.: Presolve reductions in mixed integer programming. INFORMS J. Comput. 32 (2019). https:\/\/doi.org\/10.1287\/ijoc.2018.0857","DOI":"10.1287\/ijoc.2018.0857"},{"key":"3_CR3","unstructured":"Bolusani, S., et al.: The SCIP optimization suite 9.0 (2024). https:\/\/arxiv.org\/abs\/2402.17702"},{"key":"3_CR4","doi-asserted-by":"publisher","unstructured":"Brearley, A.L., Mitra, G., Williams, H.P.: Analysis of mathematical programming problems prior to applying the simplex algorithm. Math. Program. 8(1), 54\u201383 (1975). https:\/\/doi.org\/10.1007\/BF01580428","DOI":"10.1007\/BF01580428"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-319-59250-3_13","volume-title":"Integer Programming and Combinatorial Optimization","author":"K Cheung","year":"2017","unstructured":"Cheung, K., Gleixner, A., Steffy, D.E.: Verifying integer programming results. In: Eisenbrand, F., Koenemann, J. (eds.) IPCO 2017. LNCS, vol. 10328, pp. 148\u2013160. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59250-3_13"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-642-20807-2_9","volume-title":"Integer Programming and Combinatoral Optimization","author":"W Cook","year":"2011","unstructured":"Cook, W., Koch, T., Steffy, D.E., Wolter, K.: An exact rational mixed-integer programming solver. In: G\u00fcnl\u00fck, O., Woeginger, G.J. (eds.) IPCO 2011. LNCS, vol. 6655, pp. 104\u2013116. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20807-2_9"},{"issue":"3","key":"3_CR7","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/s12532-013-0055-6","volume":"5","author":"W Cook","year":"2013","unstructured":"Cook, W., Koch, T., Steffy, D.E., Wolter, K.: A hybrid branch-and-bound approach for exact rational mixed-integer programming. Math. Program. Comput. 5(3), 305\u2013344 (2013). https:\/\/doi.org\/10.1007\/s12532-013-0055-6","journal-title":"Math. Program. Comput."},{"key":"3_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-021-01749-5","author":"L Eifler","year":"2022","unstructured":"Eifler, L., Gleixner, A.: A computational status update for exact rational mixed integer programming. Math. Program. (2022). https:\/\/doi.org\/10.1007\/s10107-021-01749-5","journal-title":"Math. Program."},{"key":"3_CR9","unstructured":"Eifler, L., Gleixner, A.: Safe and verified gomory mixed integer cuts in a rational MIP framework (2023). https:\/\/arxiv.org\/abs\/2303.12365"},{"key":"3_CR10","doi-asserted-by":"publisher","unstructured":"Eifler, L., Gleixner, A., Pulaj, J.: A safe computational framework for integer programming applied to chv\u00e1tal\u2019s conjecture. ACM Trans. Math. Softw. 48(2) (2022). https:\/\/doi.org\/10.1145\/3485630","DOI":"10.1145\/3485630"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Farkas, J.: Theorie der einfachen ungleichungen. Journal f\u00fcr die reine und angewandte Mathematik 124, 1\u201327 (1902). http:\/\/eudml.org\/doc\/149129","DOI":"10.1515\/crll.1902.124.1"},{"issue":"3","key":"3_CR12","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s12532-020-00194-3","volume":"13","author":"A Gleixner","year":"2021","unstructured":"Gleixner, A., et al.: Miplib 2017: data-driven compilation of the 6th mixed-integer programming library. Math. Program. Comput. 13(3), 443\u2013490 (2021). https:\/\/doi.org\/10.1007\/s12532-020-00194-3","journal-title":"Math. Program. Comput."},{"key":"3_CR13","doi-asserted-by":"publisher","unstructured":"Gleixner, A., Steffy, D.E.: Linear programming using limited-precision oracles. Math. Program. 183(1\u20132), 525\u2013554 (2019). https:\/\/doi.org\/10.1007\/s10107-019-01444-6","DOI":"10.1007\/s10107-019-01444-6"},{"issue":"3","key":"3_CR14","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1287\/ijoc.2016.0692","volume":"28","author":"AM Gleixner","year":"2016","unstructured":"Gleixner, A.M., Steffy, D.E., Wolter, K.: Iterative refinement for linear programming. INFORMS J. Comput. 28(3), 449\u2013464 (2016)","journal-title":"INFORMS J. Comput."},{"key":"3_CR15","doi-asserted-by":"publisher","unstructured":"Klotz, E.: Identification, assessment, and correction of ill-conditioning and numerical instability in linear and integer programs. In: Newman, A., Leung, J. (eds.) Bridging Data and Decisions, pp. 54\u2013108. TutORials in Operations Research (2014). https:\/\/doi.org\/10.1287\/educ.2014.0130","DOI":"10.1287\/educ.2014.0130"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Land, A.H., Doig, A.G.: An automatic method of solving discrete programming problems. Econometrica 28(3), 497\u2013520 (1960). http:\/\/www.jstor.org\/stable\/1910129","DOI":"10.2307\/1910129"},{"key":"3_CR17","doi-asserted-by":"publisher","unstructured":"Neumaier, A., Shcherbina, O.: Safe bounds in linear and mixed-integer linear programming. Math. Program. 99, 283\u2013296 (2004). https:\/\/doi.org\/10.1007\/s10107-003-0433-3","DOI":"10.1007\/s10107-003-0433-3"},{"key":"3_CR18","doi-asserted-by":"publisher","unstructured":"Pan, V.Y.: Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization. Comput. Math. Appl. 62(4), 1685\u20131706 (2011). https:\/\/doi.org\/10.1016\/j.camwa.2011.06.006. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0898122111004743","DOI":"10.1016\/j.camwa.2011.06.006"},{"key":"3_CR19","unstructured":"Paxian, T., Biere, A.: Uncovering and classifying bugs in MaxSAT solvers through fuzzing and delta debugging. In: J\u00e4rvisalo, M., Le\u00a0Berre, D. (eds.) Proceedings of the 14th Internantional Workshop on Pragmatics of SAT Co-located with the 26th International Conference on Theory and Applicationas of Satisfiability Testing (SAT 2003), Alghero, Italy, 4 July 2023. CEUR Workshop Proceedings, vol.\u00a03545, pp. 59\u201371. CEUR-WS.org (2023). http:\/\/ceur-ws.org\/Vol-3545\/paper5.pdf"},{"key":"3_CR20","doi-asserted-by":"publisher","unstructured":"Saunders, B.D., Wood, D.H., Youse, B.S.: Numeric-symbolic exact rational linear system solver. In: Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation, ISSAC 2011, pp. 305\u2013312. Association for Computing Machinery, New York (2011). https:\/\/doi.org\/10.1145\/1993886.1993932","DOI":"10.1145\/1993886.1993932"},{"key":"3_CR21","unstructured":"Steffy, D., Wolter, K.: Valid linear programming bounds for exact mixed-integer programming. Technical Report 11-08, ZIB, Takustr. 7, 14195 Berlin (2011)"},{"key":"3_CR22","unstructured":"Steffy, D.E.: Topics in exact precision mathematical programming. Ph.D. thesis, Georgia Institute of Technology (2011). http:\/\/hdl.handle.net\/1853\/39639"},{"key":"3_CR23","doi-asserted-by":"publisher","unstructured":"Ursic, S., Patarra, C.: Exact solution of systems of linear equations with iterative methods. SIAM J. Algebraic Discrete Methods 4(1), 111\u2013115 (1983). https:\/\/doi.org\/10.1137\/0604014","DOI":"10.1137\/0604014"},{"key":"3_CR24","doi-asserted-by":"publisher","unstructured":"Vries, S., Vohra, R.: Combinatorial auctions: a survey. INFORMS J. Comput. 15, 284\u2013309 (2003). https:\/\/doi.org\/10.1287\/ijoc.15.3.284.16077","DOI":"10.1287\/ijoc.15.3.284.16077"},{"key":"3_CR25","doi-asserted-by":"publisher","unstructured":"Wan, Z.: An algorithm to solve integer linear systems exactly using numerical methods. J. Symb. Comput. 41(6), 621\u2013632 (2006). https:\/\/doi.org\/10.1016\/j.jsc.2005.11.001. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0747717105001653","DOI":"10.1016\/j.jsc.2005.11.001"}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-95976-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T06:00:15Z","timestamp":1777528815000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-95976-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031959752","9783031959769"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-95976-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"29 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 November 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 November 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/cpaior2025","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}