{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T17:30:23Z","timestamp":1776965423599,"version":"3.51.4"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1972,2,1]],"date-time":"1972-02-01T00:00:00Z","timestamp":65750400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1972,2]]},"DOI":"10.1007\/bf01584548","type":"journal-article","created":{"date-parts":[[2005,6,27]],"date-time":"2005-06-27T17:42:40Z","timestamp":1119894160000},"page":"263-278","source":"Crossref","is-referenced-by-count":169,"title":["Updated triangular factors of the basis to maintain sparsity in the product form simplex method"],"prefix":"10.1007","volume":"2","author":[{"given":"J. J. H.","family":"Forrest","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. A.","family":"Tomlin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01584548_CR1","doi-asserted-by":"crossref","unstructured":"R.H. Bartels, \u201cA numerical investigation of the simplex method,\u201d Computer Science Department, Stanford University, Technical Report No. CS-104, July 31, 1968.","DOI":"10.21236\/AD0673010"},{"key":"BF01584548_CR2","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1145\/362946.362974","volume":"12","author":"R.H. Bartels","year":"1969","unstructured":"R.H. Bartels and G.H. Golub, \u201cThe simplex method of linear programming using LU decomposition,\u201dCommunications ACM 12 (1969) 266\u2013268, 275\u2013278.","journal-title":"Communications ACM"},{"key":"BF01584548_CR3","first-page":"1","volume-title":"Large sparse sets of linear equations","author":"E.M.L. Beale","year":"1970","unstructured":"E.M.L. Beale, \u201cSparseness in linear programming,\u201d in:Large sparse sets of linear equations, Ed. J.K. Reid (Academic Press, London, 1970) pp. 1\u201315."},{"key":"BF01584548_CR4","unstructured":"J.M. Bennett and D.R. Green, \u201cUpdating the inverse or the triangular factors of a modified matrix,\u201d Basser Computing Department, University of Sydney, Technical Report No. 42, April, 1966."},{"key":"BF01584548_CR5","volume-title":"\u201cSome results on sparse matrices,\u201d RC-2332","author":"R.K. Brayton","year":"1969","unstructured":"R.K. Brayton, F.G. Gustavson and R.A. Willoughby, \u201cSome results on sparse matrices,\u201d RC-2332, IBM Research Centre, Yorktown Heights, N.Y., February 14, 1969."},{"key":"BF01584548_CR6","first-page":"211","volume-title":"Large sparse sets of linear equations","author":"J. Buchet de","year":"1970","unstructured":"J. de Buchet, \u201cHow to take into account the low density of matrices to design a mathematical programming package \u2014 Relevant effects on optimization and inversion algorithms,\u201d in:Large sparse sets of linear equations, Ed. J.K. Reid (Academic Press, London, 1970) pp. 211\u2013217."},{"key":"BF01584548_CR7","volume-title":"Linear programming and extensions","author":"G.B. Dantzig","year":"1963","unstructured":"G.B. Dantzig,Linear programming and extensions (Princeton University Press, Princeton, 1963)."},{"key":"BF01584548_CR8","first-page":"125","volume-title":"Recent Advances in mathematical programming","author":"G.B. Dantzig","year":"1963","unstructured":"G.B. Dantzig, \u201cCompact basis triangularization for the simplex method,\u201d in:Recent Advances in mathematical programming, eds. R.L. Graves and P. Wolfe (McGraw-Hill, New York, 1963) pp. 125\u2013132."},{"key":"BF01584548_CR9","first-page":"85","volume-title":"Sparse matrix proceedings","author":"G.B. Dantzig","year":"1969","unstructured":"G.B. Dantzig, R.P. Harvey, R.D. McKnight and S.S. Smith, \u201cSparse matrix techniques in two mathematical programming codes,\u201d in:Sparse matrix proceedings, Ed. R. Willoughby (RA-1, IBM Research Centre, Yorktown Heights, N.Y., 1969) pp. 85\u201399."},{"key":"BF01584548_CR10","doi-asserted-by":"crossref","unstructured":"E. Hellerman and D. Rarick, \u201cReinversion with the preassigned pivot procedure,\u201d Paper presented at the 7th Mathematical Programming Symposium, The Hague, September 1970.","DOI":"10.1007\/BF01584086"},{"key":"BF01584548_CR11","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1287\/mnsc.3.3.255","volume":"3","author":"H.M. Markowitz","year":"1957","unstructured":"H.M. Markowitz, \u201cThe elimination form of inverse and its application to linear programming,\u201d Management Science 3 (1957) 255\u2013269.","journal-title":"Management Science"},{"key":"BF01584548_CR12","volume-title":"Advanced linear programming computing techniques","author":"W. Orchard-Hays","year":"1968","unstructured":"W. Orchard-Hays,Advanced linear programming computing techniques (McGraw-Hill, New York, 1968)."},{"key":"BF01584548_CR13","first-page":"127","volume-title":"Sparse matrix proceedings","author":"D.M. Smith","year":"1969","unstructured":"D.M. Smith, \u201cData logistics for matrix inversion,\u201d in:Sparse matrix proceedings, ed. R. Willoughby (RA-1, IBM Research Centre, Yorktown Heights, N.Y., 1969) pp. 127\u2013138."},{"key":"BF01584548_CR14","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1137\/1008066","volume":"8","author":"R.P. Tewarson","year":"1966","unstructured":"R.P. Tewarson, \u201cOn the product form of inverses of sparse matrices,\u201dSIAM Reviews 8 (1966) 336\u2013342.","journal-title":"SIAM Reviews"},{"key":"BF01584548_CR15","doi-asserted-by":"crossref","unstructured":"J.A. Tomlin, \u201cMaintaining a sparse inverse in the simplex method,\u201d Operations Research Department, Stanford University, Technical Report 70-15, November 1970.","DOI":"10.21236\/AD0717073"},{"key":"BF01584548_CR16","volume-title":"Rounding errors in algebraic processes","author":"J.H. Wilkinson","year":"1963","unstructured":"J.H. Wilkinson,Rounding errors in algebraic processes (Prentice-Hall, Englewood Cliffs, N.J., 1963)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01584548.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01584548\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01584548","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,3]],"date-time":"2023-05-03T13:55:56Z","timestamp":1683122156000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01584548"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1972,2]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1972,2]]}},"alternative-id":["BF01584548"],"URL":"https:\/\/doi.org\/10.1007\/bf01584548","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1972,2]]}}}