{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T11:46:18Z","timestamp":1783079178844,"version":"3.54.6"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2019,11,19]],"date-time":"2019-11-19T00:00:00Z","timestamp":1574121600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,11,19]],"date-time":"2019-11-19T00:00:00Z","timestamp":1574121600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"German Ministry of Education and Research","award":["05M14ZAM"],"award-info":[{"award-number":["05M14ZAM"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s10107-019-01444-6","type":"journal-article","created":{"date-parts":[[2019,11,19]],"date-time":"2019-11-19T03:01:30Z","timestamp":1574132490000},"page":"525-554","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Linear programming using limited-precision oracles"],"prefix":"10.1007","volume":"183","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0391-5903","authenticated-orcid":false,"given":"Ambros","family":"Gleixner","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0370-9555","authenticated-orcid":false,"given":"Daniel E.","family":"Steffy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,11,19]]},"reference":[{"key":"1444_CR1","unstructured":"Abbott, J., Mulders, T.: How tight is Hadamard\u2019s bound? Exp. Math. 10(3), 331\u2013336 (2001). http:\/\/projecteuclid.org\/euclid.em\/1069786341"},{"key":"1444_CR2","unstructured":"Applegate, D.L., Cook, W., Dash, S., Espinoza, D.G.: QSopt_ex. http:\/\/www.dii.uchile.cl\/~daespino\/ESolver_doc\/"},{"issue":"6","key":"1444_CR3","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1016\/j.orl.2006.12.010","volume":"35","author":"DL Applegate","year":"2007","unstructured":"Applegate, D.L., 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."},{"key":"1444_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/3-540-49481-2_6","volume-title":"Principles and Practice of Constraint Programming\u2014CP98","author":"DO Azulay","year":"1998","unstructured":"Azulay, D.O., Pique, J.F.: Optimized $$Q$$-pivot for exact linear solvers. In: Maher, M., Puget, J.F. (eds.) Principles and Practice of Constraint Programming\u2014CP98. Lecture Notes in Computer Science, vol. 1520, pp. 55\u201371. Springer, Berlin (1998). https:\/\/doi.org\/10.1007\/3-540-49481-2_6"},{"key":"1444_CR5","doi-asserted-by":"publisher","unstructured":"Chen, Z., Storjohann, A.: A BLAS based C library for exact linear algebra on integer matrices. In: Proceedings of the 2005 International Symposium on Symbolic and Algebraic Computation, ISSAC \u201905, pp. 92\u201399 (2005). https:\/\/doi.org\/10.1145\/1073884.1073899","DOI":"10.1145\/1073884.1073899"},{"key":"1444_CR6","doi-asserted-by":"publisher","unstructured":"Cheung, D., Cucker, F.: Solving linear programs with finite precision: II. Algorithms. J. Complex. 22(3), 305\u2013335 (2006). https:\/\/doi.org\/10.1016\/j.jco.2005.10.001. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0885064X05000956","DOI":"10.1016\/j.jco.2005.10.001"},{"key":"1444_CR7","unstructured":"Computational Optimization Research at Lehigh: MIP Instances. http:\/\/coral.ie.lehigh.edu\/data-sets\/mixed-integer-instances\/"},{"issue":"4","key":"1444_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1916461.1916463","volume":"37","author":"W Cook","year":"2011","unstructured":"Cook, W., Steffy, D.E.: Solving very sparse rational systems of equations. ACM Trans. Math. Softw. 37(4), 1\u201339 (2011). https:\/\/doi.org\/10.1145\/1916461.1916463","journal-title":"ACM Trans. Math. Softw."},{"key":"1444_CR9","unstructured":"Dhiflaoui, M., Funke, S., Kwappik, C., Mehlhorn, K., Seel, M., Sch\u00f6mer, E., Schulte, R., Weber, D.: Certifying and repairing solutions to large LPs: How good are LP-solvers? In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA \u201903, SIAM, pp. 255\u2013256 (2003)"},{"issue":"4","key":"1444_CR10","doi-asserted-by":"publisher","first-page":"241","DOI":"10.6028\/jres.071B.033","volume":"71B","author":"J Edmonds","year":"1967","unstructured":"Edmonds, J.: Systems of distinct representatives and linear algebra. J. Res. Natl. Bur. Stand. 71B(4), 241\u2013245 (1967)","journal-title":"J. Res. Natl. Bur. Stand."},{"key":"1444_CR11","unstructured":"Edmonds, J., Maurras, J.F.: Note sur les $$Q$$-matrices d\u2019Edmonds. RAIRO. Recherche Op\u00e9rationnelle 31(2), 203\u2013209 (1997). http:\/\/www.numdam.org\/item?id=RO_1997__31_2_203_0"},{"issue":"4","key":"1444_CR12","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1287\/ijoc.2015.0653","volume":"27","author":"AR Escobedo","year":"2015","unstructured":"Escobedo, A.R., Moreno-Centeno, E.: Roundoff-error-free algorithms for solving linear systems via Cholesky and LU factorizations. INFORMS J. Comput. 27(4), 677\u2013689 (2015). https:\/\/doi.org\/10.1287\/ijoc.2015.0653","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"1444_CR13","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1137\/16M1089630","volume":"38","author":"AR Escobedo","year":"2017","unstructured":"Escobedo, A.R., Moreno-Centeno, E.: Roundoff-error-free basis updates of LU factorizations for the efficient validation of optimality certificates. SIAM J. Matrix Anal. Appl. 38(3), 829\u2013853 (2017). https:\/\/doi.org\/10.1137\/16M1089630","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1444_CR14","unstructured":"Espinoza, D.G.: On linear programming, integer programming and cutting planes. Ph.D. Thesis, Georgia Institute of Technology (2006). http:\/\/hdl.handle.net\/1853\/10482"},{"issue":"2","key":"1444_CR15","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0925-7721(99)00012-7","volume":"13","author":"B G\u00e4rtner","year":"1999","unstructured":"G\u00e4rtner, B.: Exact arithmetic at low cost\u2014a case study in linear programming. Comput. Geom. 13(2), 121\u2013139 (1999). https:\/\/doi.org\/10.1016\/S0925-7721(99)00012-7","journal-title":"Comput. Geom."},{"issue":"3","key":"1444_CR16","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). https:\/\/doi.org\/10.1287\/ijoc.2016.0692","journal-title":"INFORMS J. Comput."},{"key":"1444_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization, Algorithms and Combinatorics","author":"M Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization, Algorithms and Combinatorics, vol. 2. Springer, Berlin (1988)"},{"issue":"4","key":"1444_CR18","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N Karmarkar","year":"1984","unstructured":"Karmarkar, N.: A new polynomial-time algorithm for linear programming. Combinatorica 4(4), 373\u2013395 (1984). https:\/\/doi.org\/10.1007\/BF02579150","journal-title":"Combinatorica"},{"key":"1444_CR19","doi-asserted-by":"publisher","unstructured":"Khachiyan, L.G.: Polynomial algorithms in linear programming (in Russian). Zhurnal Vychislitel\u2019noi Matematiki i Matematicheskoi Fiziki 20(1), 51\u201368 [English translation: USSR Computational Mathematics and Mathematical Physics, 20(1):53\u201372, 1980] (1980). https:\/\/doi.org\/10.1016\/0041-5553(80)90061-0","DOI":"10.1016\/0041-5553(80)90061-0"},{"issue":"2","key":"1444_CR20","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/S0167-6377(03)00094-4","volume":"32","author":"T Koch","year":"2004","unstructured":"Koch, T.: The final NETLIB-LP results. Oper. Res. Lett. 32(2), 138\u2013142 (2004). https:\/\/doi.org\/10.1016\/S0167-6377(03)00094-4","journal-title":"Oper. Res. Lett."},{"key":"1444_CR21","unstructured":"Kwappik, C.: Exact linear programming. Master\u2019s Thesis, Universit\u00e4t des Saarlandes (1998)"},{"issue":"4","key":"1444_CR22","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra, H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Math. Ann. 261(4), 515\u2013534 (1982). https:\/\/doi.org\/10.1007\/BF01457454","journal-title":"Math. Ann."},{"key":"1444_CR23","unstructured":"M\u00e9sz\u00e1ros, C.: LP test set. http:\/\/www.sztaki.hu\/~meszaros\/public_ftp\/lptestset\/"},{"key":"1444_CR24","unstructured":"Mittelmann, H.: LP test set. http:\/\/plato.asu.edu\/ftp\/lptestset\/"},{"issue":"3","key":"1444_CR25","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1137\/070705702","volume":"39","author":"PQ Nguyen","year":"2009","unstructured":"Nguyen, P.Q., Stehl\u00e9, D.: An LLL algorithm with quadratic complexity. SIAM J. Comput. 39(3), 874\u2013903 (2009). https:\/\/doi.org\/10.1137\/070705702","journal-title":"SIAM J. Comput."},{"issue":"1\u20133","key":"1444_CR26","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BF01580724","volume":"40","author":"J Renegar","year":"1988","unstructured":"Renegar, J.: A polynomial-time algorithm based on Newton\u2019s method, for linear programming. Math. Program. 40(1\u20133), 59\u201393 (1988). https:\/\/doi.org\/10.1007\/BF01580724","journal-title":"Math. Program."},{"key":"1444_CR27","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, New York (1986)"},{"issue":"3\/4","key":"1444_CR28","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1145\/1940475.1940513","volume":"44","author":"DE Steffy","year":"2011","unstructured":"Steffy, D.E.: Exact solutions to linear systems of equations using output sensitive lifting. ACM Commun. Comput. Algebra 44(3\/4), 160\u2013182 (2011). https:\/\/doi.org\/10.1145\/1940475.1940513","journal-title":"ACM Commun. Comput. Algebra"},{"key":"1444_CR29","unstructured":"University of Tennessee Knoxville and Oak Ridge National Laboratory: Netlib LP Library. http:\/\/www.netlib.org\/lp\/"},{"issue":"32","key":"1444_CR30","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1137\/S0097539702408636","volume":"2","author":"X Wang","year":"2003","unstructured":"Wang, X., Pan, V.Y.: Acceleration of euclidean algorithm and rational number reconstruction. SIAM J. Comput. 2(32), 548\u2013556 (2003)","journal-title":"SIAM J. Comput."},{"key":"1444_CR31","unstructured":"Zuse Institute Berlin: MIPLIB\u2014Mixed Integer Problem Library. http:\/\/miplib.zib.de\/"},{"key":"1444_CR32","unstructured":"Zuse Institute Berlin: SoPlex. Sequential object-oriented simPlex. http:\/\/soplex.zib.de\/"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-019-01444-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-019-01444-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-019-01444-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T03:56:09Z","timestamp":1605671769000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-019-01444-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,19]]},"references-count":32,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["1444"],"URL":"https:\/\/doi.org\/10.1007\/s10107-019-01444-6","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,11,19]]},"assertion":[{"value":"15 May 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 October 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 November 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}