{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T07:24:53Z","timestamp":1774596293093,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T00:00:00Z","timestamp":1133395200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Applic"],"published-print":{"date-parts":[[2005,12]]},"DOI":"10.1007\/s10589-005-4802-0","type":"journal-article","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T13:03:45Z","timestamp":1127826225000},"page":"259-283","source":"Crossref","is-referenced-by-count":26,"title":["Hyper-Sparsity in the Revised Simplex Method and How to Exploit it"],"prefix":"10.1007","volume":"32","author":[{"given":"J. A. J.","family":"Hall","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K. I. M.","family":"McKinnon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4802_CR1","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1007\/BF02169151","volume":"16","author":"R.H. Bartels","year":"1971","unstructured":"R.H. Bartels, \u201cA stabilization of the simplex method.\u201d Numer. Math., vol. 16, pp. 414\u2013434, 1971.","journal-title":"Numer. Math."},{"key":"4802_CR2","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF01584341","volume":"13","author":"J. Bisschop","year":"1977","unstructured":"J. Bisschop and A.J. Meeraus, \u201cMatrix augmentation and partitioning in the updating of the basis inverse,\u201d Mathematical Programming, vol. 13, pp. 241\u2013254, 1977.","journal-title":"Mathematical Programming"},{"issue":"1","key":"4802_CR3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1287\/opre.50.1.3.17780","volume":"50","author":"R.E. Bixby","year":"2002","unstructured":"R.E. Bixby, \u201cSolving real-world linear programs: A decade and more of progress,\u201d Operations Research, vol. 50, no. 1, pp. 3\u201315, 2002.","journal-title":"Operations Research"},{"key":"4802_CR4","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/978-0-387-35514-6_2","volume-title":"System Modelling and Optimization: Methods, Theory and Applications","author":"R.E. Bixby","year":"2000","unstructured":"R.E. Bixby, M. Fenelon, Z. Gu, E. Rothberg, and R. Wunderling, \u201cMIP: Theory and practice closing the gap,\u201d in System Modelling and Optimization: Methods, Theory and Applications, M.J.D. Powell and S. Scholtes (Eds.), Kluwer: The Netherlands, 2000, pp. 19\u201349."},{"issue":"2","key":"4802_CR5","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1287\/opre.38.2.240","volume":"38","author":"W.J. Carolan","year":"1990","unstructured":"W.J. Carolan, J.E. Hill, J.L. Kennington, S. Niemi, and S.J. Wichmann, \u201cAn empirical evaluation of the KORBX algorithms for military airlift applications,\u201d Operations Research, vol. 38, no. 2, pp. 240\u2013248, 1990.","journal-title":"Operations Research"},{"key":"4802_CR6","unstructured":"V. Chv\u00e0tal, Linear Programming, Freeman, 1983."},{"key":"4802_CR7","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1090\/S0025-5718-1954-0061469-8","volume":"8","author":"G.B. Dantzig","year":"1954","unstructured":"G.B. Dantzig and W. Orchard-Hays, \u201cThe product form for the inverse in the simplex method,\u201d Math. Comp., vol. 8, pp. 64\u201367, 1954.","journal-title":"Math. Comp."},{"key":"4802_CR8","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF01581089","volume":"57","author":"J.J. Forrest","year":"1992","unstructured":"J.J. Forrest and D. Goldfarb, \u201cSteepset-edge simplex algorithms for linear programming,\u201d Mathematical Programming, vol. 57, pp. 341\u2013374, 1992.","journal-title":"Mathematical Programming"},{"key":"4802_CR9","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF01584548","volume":"2","author":"J.J.H. Forrest","year":"1972","unstructured":"J.J.H. Forrest and J.A. Tomlin, \u201cUpdated triangular factors of the basis to maintain sparsity in the product form simplex method,\u201d Mathematical Programming, vol. 2, pp. 263\u2013278, 1972.","journal-title":"Mathematical Programming"},{"key":"4802_CR10","first-page":"10","volume":"13","author":"D.M. Gay","year":"1985","unstructured":"D.M. Gay, \u201cElectronic mail distribution of linear programming test problems,\u201d Mathematical Programming Society COAL Newsletter, vol. 13, pp. 10\u201312, 1985.","journal-title":"Mathematical Programming Society COAL Newsletter"},{"issue":"5","key":"4802_CR11","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1137\/0909058","volume":"9","author":"J.R. Gilbert","year":"1988","unstructured":"J.R. Gilbert and T. Peierls, \u201cSparse partial pivoting in time proportional to arithmetic operations,\u201d SIAM J. Sci. Stat. Comput., vol. 9, no. 5, pp. 862\u2013874, 1988.","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"4802_CR12","unstructured":"J.A.J. Hall and K.I.M. McKinnon, \u201cLP test problems,\u201d http:\/\/www.maths.ed.ac.uk\/hall\/PublicLP\/, 2002."},{"key":"4802_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01580108","volume":"5","author":"P.M.J. Harris","year":"1973","unstructured":"P.M.J. Harris, \u201cPivot selection methods of the Devex LP code,\u201d Mathematical Programming, vol. 5, pp. 1\u201328, 1973.","journal-title":"Mathematical Programming"},{"key":"4802_CR14","unstructured":"ILOG, CPLEX 6.5 Reference Manual, 1999."},{"issue":"2","key":"4802_CR15","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1287\/ijoc.9.2.154","volume":"9","author":"R.D. McBride","year":"1997","unstructured":"R.D. McBride and J.W. Mamer, \u201cSolving multicommodity flow problems with a primal embedded network simplex algorithm,\u201d INFORMS Journal on Computing, vol. 9, no. 2, pp. 154\u2013163, 1997.","journal-title":"INFORMS Journal on Computing"},{"issue":"5","key":"4802_CR16","first-page":"693","volume":"46","author":"R.D. McBride","year":"2000","unstructured":"R.D. McBride and J.W. Mamer, \u201cA decomposition-based pricing procedure for large-scale linear programs: an application to the linear multicommodity flow problem,\u201d INFORMS Journal on Computing, vol. 46, no. 5, pp. 693\u2013709, 2000.","journal-title":"INFORMS Journal on Computing"},{"key":"4802_CR17","unstructured":"H.D. Mittelmann, \u201cBenchmarks for optimization software,\u201d http:\/\/www.plato.la.asu.edu\/bench.html, April 2002."},{"key":"4802_CR18","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1093\/imamat\/10.3.289","volume":"10","author":"J.A. Tomlin","year":"1972","unstructured":"J.A. Tomlin, \u201cPivoting for size and sparsity in linear programming inversion routines,\u201d J. Inst. Maths. Applics, vol. 10, pp. 289\u2013295, 1972.","journal-title":"J. Inst. Maths. Applics"},{"key":"4802_CR19","unstructured":"R. Wunderling, \u201cParalleler und objektorientierter simplex,\u201d Technical Report TR-96-09, Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin, 1996."},{"key":"4802_CR20","unstructured":"R. Wunderling, A. Bley, T. Pfender, and T. Koch, \u201cSOPLEX 1.2.0,\u201d 2002."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-005-4802-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-005-4802-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-005-4802-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T07:36:30Z","timestamp":1559288190000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-005-4802-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,12]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,12]]}},"alternative-id":["4802"],"URL":"https:\/\/doi.org\/10.1007\/s10589-005-4802-0","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,12]]}}}