{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T10:23:48Z","timestamp":1648808628195},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2006,10,1]],"date-time":"2006-10-01T00:00:00Z","timestamp":1159660800000},"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":[[2006,10]]},"DOI":"10.1007\/s10589-006-0311-z","type":"journal-article","created":{"date-parts":[[2006,10,6]],"date-time":"2006-10-06T11:02:27Z","timestamp":1160132547000},"page":"131-133","source":"Crossref","is-referenced-by-count":0,"title":["COAP 2005 Best Paper Award"],"prefix":"10.1007","volume":"35","author":[{"given":"Julian","family":"Hall","sequence":"first","affiliation":[]},{"given":"Ken","family":"McKinnon","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"311_CR1","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":"311_CR2","doi-asserted-by":"crossref","unstructured":"R.E. Bixby, M. Fenelon, Z. Gu, E. Rothberg, and R. Wunderling, \u201cMIP: Theory and practice closing the gap,\u201d in M.J.D. Powell and S. Scholtes (Eds.), System Modelling and Optimization: Methods, Theory and Applications, Kluwer, The Netherlands, 2000, pp. 19\u201349.","DOI":"10.1007\/978-0-387-35514-6_2"},{"issue":"5","key":"311_CR3","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":"311_CR4","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/BF01589114","volume":"45","author":"P.E. Gill","year":"1989","unstructured":"P.E. Gill, W. Murray, M.A. Saunders, and M.H. Wright, \u201cA practical anti-cycling procedure for linearly constrained optimization,\u201d Mathematical Programming, vol. 45, pp. 437\u2013474, 1989.","journal-title":"Mathematical Programming."},{"key":"311_CR5","doi-asserted-by":"crossref","unstructured":"J.A.J. Hall and K.I.M. McKinnon, \u201cPARSMI, a parallel revised simplex algorithm incorporating minor iterations and Devex pricing,\u201d in J. Wa\u015bniewski, J. Dongarra, K. Madsen, and D. Olesen (Eds.), Applied Parallel Computing, volume 1184 of Lecture Notes in Computer Science, Springer, pp. 67\u201376, 1996.","DOI":"10.1007\/3-540-62095-8_38"},{"key":"311_CR6","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1023\/A:1018957107705","volume":"81","author":"J.A.J. Hall","year":"1998","unstructured":"J.A.J. Hall and K.I.M. McKinnon, \u201cASYNPLEX, an asynchronous parallel revised simplex method algorithm,\u201d Annals of Operations Research, vol. 81, pp. 27\u201349, 1998.","journal-title":"Annals of Operations Research."},{"issue":"1","key":"311_CR7","first-page":"133","volume":"100","author":"J.A.J. Hall","year":"2004","unstructured":"J.A.J. Hall and K.I.M. McKinnon, \u201cThe simplest examples where the simplex method cycles and conditions where EXPAND fails to prevent cycling,\u201d Mathematical Programming, vol. 100, no. 1, pp. 133\u2013150, 2004.","journal-title":"Mathematical Programming."},{"issue":"3","key":"311_CR8","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/s10589-005-4802-0","volume":"32","author":"J.A.J. Hall","year":"2005","unstructured":"J.A.J. Hall and K.I.M. McKinnon, \u201cHyper-sparsity in the revised simplex method and how to exploit it,\u201d Computational Optimization and Applications, vol. 32, no. 3, pp. 259\u2013283, 2005.","journal-title":"Computational Optimization and Applications."},{"key":"311_CR9","unstructured":"A. Koberstein, \u201cThe Dual Simplex Method - Techniques for a fast and stable implementation,\u201d PhD thesis, University of Paderborn, 2005."},{"issue":"4","key":"311_CR10","first-page":"20","volume":"28","author":"R. Lougee-Heimer","year":"2001","unstructured":"R. Lougee-Heimer, et al., \u201cThe COIN-OR initiative: Open source accelerates operations research progress,\u201d ORMS Today, vol. 28, no. 4, pp. 20\u201322, 2001.","journal-title":"ORMS Today."},{"key":"311_CR11","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."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-006-0311-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-006-0311-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-006-0311-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T11:36:30Z","timestamp":1559302590000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-006-0311-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,10]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,10]]}},"alternative-id":["311"],"URL":"https:\/\/doi.org\/10.1007\/s10589-006-0311-z","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,10]]}}}