{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:46:17Z","timestamp":1760597177112},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1977,12,1]],"date-time":"1977-12-01T00:00:00Z","timestamp":249782400000},"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":[[1977,12]]},"DOI":"10.1007\/bf01593804","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T20:13:01Z","timestamp":1114719181000},"page":"361-371","source":"Crossref","is-referenced-by-count":146,"title":["A practicable steepest-edge simplex algorithm"],"prefix":"10.1007","volume":"12","author":[{"given":"D.","family":"Goldfarb","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. K.","family":"Reid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"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,Numerische Mathematik 16 (1971) 414\u2013434.","journal-title":"Numerische Mathematik"},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"H. Crowder and J.M. Hattingh, \u201cPartially normalized pivot selection in linear programming\u201d, IBM research report RC 4918, Yorktown Heights (1974).","DOI":"10.1007\/BFb0120708"},{"key":"CR3","volume-title":"Linear programming and extensions","author":"G.B. Dantzig","year":"1963","unstructured":"G.B. Dantzig,Linear programming and extensions (Princeton University Press, Princeton, NJ, 1963)."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/367390.367411","volume":"3","author":"J.C. Dickson","year":"1960","unstructured":"J.C. Dickson and F.P. Frederick, \u201cA decision rule for improved efficiency in solving linear programming problems with the simplex method\u201d,Communications of the ACM 3 (1960) 509\u2013512.","journal-title":"Communications of the ACM"},{"key":"CR5","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, \u201cUpdating triangular factors of the basis to maintain sparsity in the product form simplex method\u201d,Mathematical Programming 2 (1972) 263\u2013278.","journal-title":"Mathematical Programming"},{"key":"CR6","unstructured":"D. Goldfarb, \u201cOn the Bartels\u2014Golub decomposition for linear programming bases\u201d, to appear."},{"key":"CR7","unstructured":"D. Goldfarb and J.K. Reid, \u201cFortran subroutines for sparse in-core linear programming\u201d, A.E.R.E. rept., to appear."},{"key":"CR8","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 5 (1973) 1\u201328. [Reprinted inMathematical Programming Study 4 (1975) 30\u201357.]","journal-title":"Mathematical Programming"},{"key":"CR9","volume-title":"The theory of matrices in numerical analysis","author":"A.S. Householder","year":"1964","unstructured":"A.S. Householder,The theory of matrices in numerical analysis (Blaisdell, Waltham, MA, 1964)."},{"key":"CR10","volume-title":"Proceedings of symposia in applied mathematics, Vol. XV","author":"H.W. Kuhn","year":"1963","unstructured":"H.W. Kuhn and R.E. Quandt, \u201cAn experimental study of the simplex method\u201d, in: Metropolis et al., eds.,Proceedings of symposia in applied mathematics, Vol. XV (Am. Math. Soc., Providence, RI, 1963)."},{"key":"CR11","unstructured":"J.K. Reid, \u201cA sparsity-exploiting variant of the Bartels\u2014Golub decomposition for linear programming bases\u201d, to appear."},{"key":"CR12","unstructured":"M.A. Saunders, \u201cLarge-scale linear programming using the Cholesky factorization\u201d, Rept. STAN-CS-72-252 (Stanford University, 1972)."},{"key":"CR13","volume-title":"Recent advances in mathematical programming","author":"P. Wolfe","year":"1963","unstructured":"P. Wolfe and L. Cutler, \u201cExperiments in linear programming\u201d, in: Graves and Wolfe, eds.,Recent advances in mathematical programming (McGraw-Hill, New York, 1963)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01593804.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01593804\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01593804","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T04:17:35Z","timestamp":1586233055000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01593804"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977,12]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1977,12]]}},"alternative-id":["BF01593804"],"URL":"https:\/\/doi.org\/10.1007\/bf01593804","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1977,12]]}}}