{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T04:10:04Z","timestamp":1752379804511,"version":"3.41.2"},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1997,7,1]],"date-time":"1997-07-01T00:00:00Z","timestamp":867715200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,7,1]],"date-time":"1997-07-01T00:00:00Z","timestamp":867715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Optimization and Applications"],"published-print":{"date-parts":[[1997,7]]},"DOI":"10.1023\/a:1008658514906","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T10:12:40Z","timestamp":1040551960000},"page":"57-71","source":"Crossref","is-referenced-by-count":1,"title":["Recovery from Numerical Instability during Basis Reinversion"],"prefix":"10.1007","volume":"8","author":[{"given":"Jeffery L.","family":"Kennington","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Riad A.K.","family":"Mohamed","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"131341_CR1","doi-asserted-by":"crossref","first-page":"913","DOI":"10.1137\/0911053","volume":"11","author":"M. Arioli","year":"1990","unstructured":"M. Arioli, I.S. Duff, N.I. Gould, and I.K. Reid, \u201cUse of the P4 and P5 algorithms for in-core factorization of Sparse Matrices,\u201d SIAM Journal on Scientific and Statistical Computing, vol. 11, no. 5, pp. 913\u2013927, 1990.","journal-title":"SIAM Journal on Scientific and Statistical Computing"},{"key":"131341_CR2","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1145\/355958.355963","volume":"7","author":"I.S. Duff","year":"1981","unstructured":"I.S. Duff, \u201cOn algorithms for obtauning a maximum transversal,\u201d ACM Transactions on Mathematical Software, vol. 7, no. 3, pp. 315\u2013330, 1981.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"131341_CR3","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1137\/0722022","volume":"2","author":"A.M. Erisman","year":"1985","unstructured":"A.M. Erisman, R.G. Grimes, J.G. Lewis, and W.G. Poole, Jr., \u201cA structurally stable modification of Hellerman-Rarick's P4 algorithm for reordering unsymetric sparse matrices,\u201d SIAM Journal of Numerical Analysis, vol. 2, pp. 369\u2013385, 1985.","journal-title":"SIAM Journal of Numerical Analysis"},{"key":"131341_CR4","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1057\/jors.1992.76","volume":"43","author":"B. Hattersley","year":"1992","unstructured":"B. Hattersley and L. Mackley, \u201cConstruction of LU factors of the basis to reduce build-up during simplex iterations,\u201d Journal of the Operational Research Society, vol. 43, no. 5, pp. 507\u2013518, 1992.","journal-title":"Journal of the Operational Research Society"},{"key":"131341_CR5","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF01584086","volume":"1","author":"E. Hellerman","year":"1971","unstructured":"E. Hellerman and D. Rarick, \u201cReinversion with the preassigned pivot procedure,\u201d Mathematical Programming, vol. 1, pp. 195\u2013216, 1971.","journal-title":"Mathematical Programming"},{"key":"131341_CR6","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/978-1-4615-8675-3_6","volume-title":"Sparse Matrices and their Application","author":"E. Hellerman","year":"1972","unstructured":"E. Hellerman and D. Rarick, \u201cThe partitioned preassigned pivot procedure (P4),\u201d in Sparse Matrices and their Application, D.J. Rose and R.A. Willoughby (Eds.), Plenum Press: New York, pp. 67\u201376, 1972."},{"key":"131341_CR7","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF01582146","volume":"61","author":"J.K. Sankaran","year":"1993","unstructured":"J.K. Sankaran, \u201cSome new results regarding spikes and a heuristic for spike construction,\u201d Mathematical Programming, vol. 61, pp. 171\u2013195, 1993.","journal-title":"Mathematical Programming"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008658514906.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008658514906\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008658514906.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:34:45Z","timestamp":1752377685000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008658514906"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,7]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,7]]}},"alternative-id":["131341"],"URL":"https:\/\/doi.org\/10.1023\/a:1008658514906","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[1997,7]]}}}