{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:12:46Z","timestamp":1743088366144,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030738785"},{"type":"electronic","value":"9783030738792"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-73879-2_12","type":"book-chapter","created":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T23:04:59Z","timestamp":1620169499000},"page":"163-177","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Computational Status Update for Exact Rational Mixed Integer Programming"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0245-9344","authenticated-orcid":false,"given":"Leon","family":"Eifler","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0391-5903","authenticated-orcid":false,"given":"Ambros","family":"Gleixner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,5]]},"reference":[{"key":"12_CR1","unstructured":"Achterberg, T.: Constraint integer programming. Ph.D. thesis, Technische Universit\u00e4t Berlin (2007)"},{"issue":"2","key":"12_CR2","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1287\/ijoc.2018.0857","volume":"32","author":"T Achterberg","year":"2020","unstructured":"Achterberg, T., Bixby, R.E., Gu, Z., Rothberg, E., Weninger, D.: Presolve reductions in mixed integer programming. INFORMS J. Comput. 32(2), 473\u2013506 (2020). https:\/\/doi.org\/10.1287\/ijoc.2018.0857","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"12_CR3","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.orl.2004.04.002","volume":"33","author":"T Achterberg","year":"2005","unstructured":"Achterberg, T., Koch, T., Martin, A.: Branching rules revisited. Oper. Res. Lett. 33(1), 42\u201354 (2005). https:\/\/doi.org\/10.1016\/j.orl.2004.04.002","journal-title":"Oper. Res. Lett."},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/978-3-642-38189-8_18","volume-title":"Facets of Combinatorial Optimization","author":"T Achterberg","year":"2013","unstructured":"Achterberg, T., Wunderling, R.: Mixed integer programming: analyzing 12 years of progress. In: J\u00fcnger, M., Reinelt, G. (eds.) Facets of Combinatorial Optimization, pp. 449\u2013481. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38189-8_18"},{"key":"12_CR5","unstructured":"Applegate, D., Bixby, R., Chvatal, V., Cook, W.: Concorde TSP Solver (2006)"},{"issue":"6","key":"12_CR6","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1016\/j.orl.2006.12.010","volume":"35","author":"D Applegate","year":"2007","unstructured":"Applegate, D., Cook, W., Dash, S., Espinoza, D.G.: Exact solutions to linear programming problems. Oper. Res. Lett. 35(6), 693\u2013699 (2007). https:\/\/doi.org\/10.1016\/j.orl.2006.12.010","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"12_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-016-0104-z","volume":"9","author":"B Assarf","year":"2017","unstructured":"Assarf, B., et al.: Computing convex hulls and counting integer points with polymake. Math. Program. Comput. 9(1), 1\u201338 (2017). https:\/\/doi.org\/10.1007\/s12532-016-0104-z","journal-title":"Math. Program. Comput."},{"issue":"1\u20132","key":"12_CR8","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.scico.2007.08.001","volume":"72","author":"R Bagnara","year":"2008","unstructured":"Bagnara, R., Hill, P.M., Zaffanella, E.: The Parma Polyhedra Library: toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems. Sci. Comput. Program. 72(1\u20132), 3\u201321 (2008)","journal-title":"Sci. Comput. Program."},{"issue":"6","key":"12_CR9","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1016\/j.orl.2013.08.007","volume":"41","author":"T Berthold","year":"2013","unstructured":"Berthold, T.: Measuring the impact of primal heuristics. Oper. Res. Lett. 41(6), 611\u2013614 (2013). https:\/\/doi.org\/10.1016\/j.orl.2013.08.007","journal-title":"Oper. Res. Lett."},{"key":"12_CR10","unstructured":"Biere, A., Heule, M., van Maaren, H., Walsh, T.: Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications. IOS Press, Amsterdam (2009)"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"2187","DOI":"10.1007\/s00500-018-3365-9","volume":"23","author":"M Bofill","year":"2019","unstructured":"Bofill, M., Many\u00e0, F., Vidal, A., Villaret, M.: New complexity results for \u0141ukasiewicz logic. Soft. Comput. 23, 2187\u20132197 (2019). https:\/\/doi.org\/10.1007\/s00500-018-3365-9","journal-title":"Soft. Comput."},{"key":"12_CR12","doi-asserted-by":"publisher","unstructured":"Burton, B.A., Ozlen, M.: Computing the crosscap number of a knot using integer programming and normal surfaces. ACM Trans. Math. Softw. 39(1) (2012). https:\/\/doi.org\/10.1145\/2382585.2382589","DOI":"10.1145\/2382585.2382589"},{"key":"12_CR13","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":"KKH Cheung","year":"2017","unstructured":"Cheung, K.K.H., 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":"12_CR14","unstructured":"Cheung, K., Gleixner, A., Steffy, D.: VIPR. Verifying Integer Programming Results. https:\/\/github.com\/ambros-gleixner\/VIPR. Accessed 11 Nov 2020"},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1287\/ijoc.1090.0324","volume":"21","author":"W Cook","year":"2009","unstructured":"Cook, W., Dash, S., Fukasawa, R., Goycoolea, M.: Numerically safe gomory mixed-integer cuts. INFORMS J. Comput. 21, 641\u2013649 (2009). https:\/\/doi.org\/10.1287\/ijoc.1090.0324","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"12_CR16","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":"12_CR17","unstructured":"Eifler, L., Gleixner, A.: Exact SCIP - a development version. https:\/\/github.com\/leoneifler\/exact-SCIP. Accessed 11 Nov 2020"},{"key":"12_CR18","unstructured":"Eifler, L., Gleixner, A., Pulaj, J.: A safe computational framework for integer programming applied to Chv\u00e1tal\u2019s conjecture (2020)"},{"key":"12_CR19","unstructured":"Espinoza, D.G.: On linear programming, integer programming and cutting planes. Ph.D. thesis, Georgia Institute of Technology (2006)"},{"key":"12_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-540-79719-7_8","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2008","author":"G Faure","year":"2008","unstructured":"Faure, G., Nieuwenhuis, R., Oliveras, A., Rodr\u00edguez-Carbonell, E.: SAT modulo the theory of linear arithmetic: exact, inexact and commercial solvers. In: Kleine B\u00fcning, H., Zhao, X. (eds.) SAT 2008. LNCS, vol. 4996, pp. 77\u201390. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-79719-7_8"},{"key":"12_CR21","unstructured":"Gamrath, G., et al.: The SCIP Optimization Suite 7.0. ZIB-Report 20\u201310, Zuse Institute Berlin (2020)"},{"key":"12_CR22","doi-asserted-by":"publisher","unstructured":"Gleixner, A., et al.: MIPLIB 2017: data-driven compilation of the 6th\u00a0mixed-integer programming library. Math. Program. Comput. 1\u201348 (2021). https:\/\/doi.org\/10.1007\/s12532-020-00194-3","DOI":"10.1007\/s12532-020-00194-3"},{"key":"12_CR23","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/s10107-019-01444-6","volume":"183","author":"A Gleixner","year":"2020","unstructured":"Gleixner, A., Steffy, D.E.: Linear programming using limited-precision oracles. Math. Program. 183, 525\u2013554 (2020). https:\/\/doi.org\/10.1007\/s10107-019-01444-6","journal-title":"Math. Program."},{"issue":"3","key":"12_CR24","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1287\/ijoc.2016.0692","volume":"28","author":"A Gleixner","year":"2016","unstructured":"Gleixner, A., Steffy, D.E., Wolter, K.: Iterative refinement for linear programming. INFORMS J. Comput. 28(3), 449\u2013464 (2016). https:\/\/doi.org\/10.1287\/ijoc.2016.0692","journal-title":"INFORMS J. Comput."},{"key":"12_CR25","unstructured":"Gottwald, L.: PaPILO \u2013 Parallel Presolve for Integer and Linear Optimization. https:\/\/github.com\/lgottwald\/PaPILO. Accessed 9 Sep 2020"},{"key":"12_CR26","unstructured":"Granlund, T., Team, G.D.: GNU MP 6.0 Multiple Precision Arithmetic Library. Samurai Media Limited, London, GBR (2015)"},{"key":"12_CR27","doi-asserted-by":"publisher","unstructured":"Higham, N.J.: Accuracy and Stability of Numerical Algorithms, 2nd edn. Society for Industrial and Applied Mathematics, Philadelphia (2002). https:\/\/doi.org\/10.1137\/1.9780898718027","DOI":"10.1137\/1.9780898718027"},{"key":"12_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/978-3-030-04651-4_46","volume-title":"Combinatorial Optimization and Applications","author":"F Kenter","year":"2018","unstructured":"Kenter, F., Skipper, D.: Integer-programming bounds on pebbling numbers of Cartesian-product graphs. In: Kim, D., Uma, R.N., Zelikovsky, A. (eds.) COCOA 2018. LNCS, vol. 11346, pp. 681\u2013695. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-04651-4_46"},{"key":"12_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-030-49988-4_5","volume-title":"Mathematical Optimization Theory and Operations Research","author":"G Lancia","year":"2020","unstructured":"Lancia, G., Pippia, E., Rinaldi, F.: Using integer programming to search for counterexamples: a case study. In: Kononov, A., Khachay, M., Kalyagin, V.A., Pardalos, P. (eds.) MOTOR 2020. LNCS, vol. 12095, pp. 69\u201384. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-49988-4_5"},{"key":"12_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L de Moura","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24"},{"key":"12_CR31","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s10107-003-0433-3","volume":"99","author":"A Neumaier","year":"2002","unstructured":"Neumaier, A., Shcherbina, O.: Safe bounds in linear and mixed-integer programming. Math. Program. 99, 283\u2013296 (2002). https:\/\/doi.org\/10.1007\/s10107-003-0433-3","journal-title":"Math. Program."},{"issue":"322","key":"12_CR32","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1090\/mcom\/3461","volume":"89","author":"J Pulaj","year":"2020","unstructured":"Pulaj, J.: Cutting planes for families implying Frankl\u2019s conjecture. Math. Comput. 89(322), 829\u2013857 (2020). https:\/\/doi.org\/10.1090\/mcom\/3461","journal-title":"Math. Comput."},{"issue":"2","key":"12_CR33","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1287\/ijoc.1120.0501","volume":"25","author":"DE Steffy","year":"2013","unstructured":"Steffy, D.E., Wolter, K.: Valid linear programming bounds for exact mixed-integer programming. INFORMS J. Comput. 25(2), 271\u2013284 (2013). https:\/\/doi.org\/10.1287\/ijoc.1120.0501","journal-title":"INFORMS J. Comput."},{"key":"12_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/978-3-319-09284-3_31","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2014","author":"N Wetzler","year":"2014","unstructured":"Wetzler, N., Heule, M.J.H., Hunt, W.A.: DRAT-trim: efficient checking and trimming using expressive clausal proofs. In: Sinz, C., Egly, U. (eds.) SAT 2014. LNCS, vol. 8561, pp. 422\u2013429. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09284-3_31"},{"issue":"5","key":"12_CR35","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/358438.349318","volume":"35","author":"K Wilken","year":"2000","unstructured":"Wilken, K., Liu, J., Heffernan, M.: Optimal instruction scheduling using integer programming. SIGPLAN Not. 35(5), 121\u2013133 (2000). https:\/\/doi.org\/10.1145\/358438.349318","journal-title":"SIGPLAN Not."}],"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-030-73879-2_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T23:06:37Z","timestamp":1620169597000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-73879-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030738785","9783030738792"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-73879-2_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"5 May 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"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":"Atlanta, GA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 May 2021","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":"ipco2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.gatech.edu\/ipco-2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"90","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the COVID-19 pandemic the conference took place virtually","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}