{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,25]],"date-time":"2024-01-25T13:45:24Z","timestamp":1706190324254},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1983,5,1]],"date-time":"1983-05-01T00:00:00Z","timestamp":420595200000},"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":[[1983,5]]},"DOI":"10.1007\/bf02591889","type":"journal-article","created":{"date-parts":[[2007,3,29]],"date-time":"2007-03-29T11:38:12Z","timestamp":1175168292000},"page":"1-20","source":"Crossref","is-referenced-by-count":34,"title":["Large-scale linear programming: Geometry, working bases and factorizations"],"prefix":"10.1007","volume":"26","author":[{"given":"Michael J.","family":"Todd","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02591889_CR1","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1002\/net.3230080405","volume":"8","author":"A.I. Ali","year":"1978","unstructured":"A.I. Ali, R.V. Helgason, J.L. Kennington and H.S. Lall, \u201cPrimal simplex network codes: state-of-the-art implementation technology\u201d,Networks 8 (1978) 315\u2013339.","journal-title":"Networks"},{"key":"BF02591889_CR2","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1002\/net.3230080107","volume":"8","author":"A.A. Assad","year":"1978","unstructured":"A.A. Assad, \u201cMulticommodity network flows\u2014a survey\u201d,Networks 8 (1978) 37\u201391.","journal-title":"Networks"},{"key":"BF02591889_CR3","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":"BF02591889_CR4","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/B978-0-12-597050-1.50009-9","volume-title":"Nonlinear programming","author":"R.H. Bartels","year":"1970","unstructured":"R.H. Bartels, G.H. Golub and M.A. Saunders, \u201cNumerical techniques in mathematical programming\u201d, in: J.B. Rosen, O.L. Mangasarian and K. Ritter, eds.,Nonlinear programming (Academic Press, New York, 1970) pp. 123\u2013176."},{"key":"BF02591889_CR5","doi-asserted-by":"crossref","first-page":"1166","DOI":"10.1287\/opre.16.6.1166","volume":"16","author":"A. Ben-Israel","year":"1968","unstructured":"A. Ben-Israel and A. Charnes, \u201cAn explicit solution of a special class of linear programming problems\u201d,Operations Research 16 (1968) 1166\u20131175.","journal-title":"Operations Research"},{"key":"BF02591889_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.24.1.1","volume":"24","author":"G.H. Bradley","year":"1977","unstructured":"G.H. Bradley, G.G. Brown and G.W. Graves, \u201cDesign and implementation of large scale primal transshipment algorithms\u201d,Management Science 24 (1977) 1\u201334.","journal-title":"Management Science"},{"key":"BF02591889_CR7","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/net.3230070105","volume":"7","author":"S. Chen","year":"1977","unstructured":"S. Chen and R. Saigal, \u201cA primal algorithm for solving a capacitated network flow problem with additional linear constraints\u201d,Networks 7 (1977) 59\u201379.","journal-title":"Networks"},{"key":"BF02591889_CR8","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF01609039","volume":"15","author":"R.C. Daniel","year":"1978","unstructured":"R.C. Daniel, \u201cA note on Schrage's generalized variable upper bounds\u201d,Mathematical Programming 15 (1978) 349\u2013351.","journal-title":"Mathematical Programming"},{"key":"BF02591889_CR9","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":"BF02591889_CR10","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: R.L. Graves and P. Wolfe, eds.,Recent advances in mathematical programming (McGraw-Hill, New York. 1963) pp. 125\u2013132."},{"key":"BF02591889_CR11","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/S0022-0000(67)80015-1","volume":"1","author":"G.B. Dantzig","year":"1967","unstructured":"G.B. Dantzig and R.M. van Slyke, \u201cGeneralized upper bounding techniques\u201d,Journal of Computer System Sciences 1 (1967) 213\u2013226.","journal-title":"Journal of Computer System Sciences"},{"key":"BF02591889_CR12","doi-asserted-by":"crossref","unstructured":"G.B. Dantzig and P. Wolfe, \u201cThe decomposition algorithm for linear programming\u201d,Econometrica 29 (1961).","DOI":"10.2307\/1911818"},{"key":"BF02591889_CR13","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":"BF02591889_CR14","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0024-3795(73)90047-5","volume":"7","author":"P.E. Gill","year":"1973","unstructured":"P.E. Gill and W. Murray, \u201cA numerically stable form of the simplex algorithm\u201d,Journal of Linear Algebra and its Applications 7 (1973) 99\u2013138.","journal-title":"Journal of Linear Algebra and its Applications"},{"key":"BF02591889_CR15","volume-title":"The state of the art in numerical analysis","author":"P.E. Gill","year":"1977","unstructured":"P.E. Gill and W. Murray, \u201cLinearly-constrained problems including linear and quadratic programming\u201d, in: D.A.H. Jacobs, ed.,The state of the art in numerical analysis (Academic Press, London, 1977)."},{"key":"BF02591889_CR16","first-page":"1051","volume":"29","author":"P.E. Gill","year":"1975","unstructured":"P.E. Gill, W. Murray and M.A. Saunders, \u201cMethods for computing and modifying theLDV factors of a matrix\u201d,Mathematics of Computation 29 (1975) 1051\u20131077.","journal-title":"Mathematics of Computation"},{"key":"BF02591889_CR17","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1002\/net.3230040302","volume":"4","author":"F. Glover","year":"1974","unstructured":"F. Glover, D. Karney and D. Klingman, \u201cImplementation and computational comparison of primal, dual and primal-dual computer codes for minimum cost network flow problems\u201d,Networks 4 (1974) 191\u2013212.","journal-title":"Networks"},{"key":"BF02591889_CR18","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF01580655","volume":"10","author":"G.W. Graves","year":"1976","unstructured":"G.W. Graves and R.D. McBride, \u201cThe factorization approach to large-scale linear programming\u201d,Mathematical Programming 10 (1976) 91\u2013110.","journal-title":"Mathematical Programming"},{"key":"BF02591889_CR19","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF01584987","volume":"3","author":"M.D. Grigoriadis","year":"1972","unstructured":"M.D. Grigoriadis and W.W. White, \u201cA partitioning algorithm for the multicommodity network flow problem\u201d,Mathematical Programming 3 (1972) 157\u2013177.","journal-title":"Mathematical Programming"},{"key":"BF02591889_CR20","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1002\/zamm.19780581006","volume":"58","author":"R. Gupta","year":"1978","unstructured":"R. Gupta, \u201cSolving the generalized transportation problem with constraints\u201d,Zeitschrift f\u00fcr Angewandte Mathematik und Mechanik 58 (1978) 451\u2013458.","journal-title":"Zeitschrift f\u00fcr Angewandte Mathematik und Mechanik"},{"key":"BF02591889_CR21","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1002\/net.3230010404","volume":"1","author":"J.K. Hartman","year":"1972","unstructured":"J.K. Hartman and L.S. Lasdon, \u201cA generalized upper bounding algorithm for multicommodity network flow problems\u201d,Networks 1 (1972) 333\u2013354.","journal-title":"Networks"},{"key":"BF02591889_CR22","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1287\/opre.14.4.619","volume":"14","author":"E.L. Johnson","year":"1966","unstructured":"E.L. Johnson, \u201cNetworks and basic solutions\u201d,Operations Research 14 (1966) 619\u2013624.","journal-title":"Operations Research"},{"key":"BF02591889_CR23","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1287\/opre.25.1.89","volume":"25","author":"M. Kallio","year":"1977","unstructured":"M. Kallio and E.L. Porteus, \u201cTriangular factorization and generalized upper bounding techniques\u201d,Operations Research 25 (1977) 89\u201399.","journal-title":"Operations Research"},{"key":"BF02591889_CR24","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1287\/opre.26.2.209","volume":"26","author":"J.L. Kennington","year":"1978","unstructured":"J.L. Kennington, \u201cA survey of linear cost multicommodity network flows\u201d,Operations Research 26 (1978) 209\u2013236.","journal-title":"Operations Research"},{"key":"BF02591889_CR25","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1287\/opre.23.1.91","volume":"23","author":"D. Klingman","year":"1975","unstructured":"D. Klingman and R. Russell, \u201cSolving constrained transportation problems\u201d,Operations Research 23 (1975) 91\u2013106.","journal-title":"Operations Research"},{"key":"BF02591889_CR26","volume-title":"Optimization theory for large systems","author":"L.S. Lasdon","year":"1970","unstructured":"L.S. Lasdon,Optimization theory for large systems (Macmillan, New York, 1970)."},{"key":"BF02591889_CR27","unstructured":"S. Maier. \u201cA compact inverse scheme applied to a multicommodity network with resource constraints\u201d, in: R.W. Cottle and J. Krarup, eds.,Optimization methods for resource allocation (English Universities Press, 1972)."},{"key":"BF02591889_CR28","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 the inverse and its application to linear programming\u201d,Management Science 3 (1957) 255\u2013269.","journal-title":"Management Science"},{"key":"BF02591889_CR29","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF01588296","volume":"18","author":"R.D. McBride","year":"1980","unstructured":"R.D. McBride, \u201cA bump triangular dynamic factorization algorithm for the simplex method\u201d,Mathematical Programming 18 (1980) 49\u201361.","journal-title":"Mathematical Programming"},{"key":"BF02591889_CR30","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF01588950","volume":"14","author":"B.A. Murtagh","year":"1978","unstructured":"B.A. Murtagh and M.A. Saunders, \u201cLarge-scale linearly constrained optimization\u201d,Mathematical Programming 14 (1978) 41\u201372.","journal-title":"Mathematical Programming"},{"key":"BF02591889_CR31","unstructured":"J.K. Reid, \u201cA sparsity-exploiting variant of the Bartels-Golub decomposition for linear programming bases\u201d, Report CSS 20, Computer Science and Systems Division, A.E.R.E. Harwell (1975)."},{"key":"BF02591889_CR32","series-title":"ORC67-14","volume-title":"Multicommodity flows in directed networks","author":"R. Saigal","year":"1967","unstructured":"R. Saigal, \u201cMulticommodity flows in directed networks\u201d, ORC67-14, Operations Research Center, University of California at Berkeley, Berkeley, CA (1967)."},{"key":"BF02591889_CR33","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/B978-0-12-141050-6.50017-9","volume-title":"Sparse matrix computations","author":"M.A. Saunders","year":"1976","unstructured":"M.A. Saunders, \u201cA fast, stable implementation of the simplex method using Bartels-Golub updating\u201d, in: J.R. Bunch and D.J. Rose, eds.,Sparse matrix computations (Academic Press, New York, 1976), pp. 213\u2013226."},{"key":"BF02591889_CR34","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1007\/BFb0120715","volume":"4","author":"L. Schrage","year":"1975","unstructured":"L. Schrage, \u201cImplicit representation of variable upper bounds in linear programming\u201d,Mathematical Programming Study 4 (1975) 118\u2013132.","journal-title":"Mathematical Programming Study"},{"key":"BF02591889_CR35","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/BF01588948","volume":"14","author":"L. Schrage","year":"1978","unstructured":"L. Schrage, \u201cImplicit representation of generalized variable upper bounds in linear programming\u201d,Mathematical Programming 14 (1978) 11\u201320.","journal-title":"Mathematical Programming"},{"key":"BF02591889_CR36","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1145\/321752.321754","volume":"20","author":"V. Srinivasan","year":"1973","unstructured":"V. Srinivasan and G.L. Thompson, \u201cBenefit-cost analysis of coding techniques for the primal transshipment algorithm\u201d,Journal of the Association for Computing Machinery 20 (1973) 194\u2013213.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"BF02591889_CR37","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/BF01583778","volume":"23","author":"M.J. Todd","year":"1982","unstructured":"M.J. Todd, \u201cAn implementation of the simplex method for linear programming problems with variable upper bounds\u201d,Mathematical Programming 23 (1982) 34\u201349.","journal-title":"Mathematical Programming"},{"key":"BF02591889_CR38","doi-asserted-by":"crossref","first-page":"664","DOI":"10.1287\/opre.22.3.664","volume":"22","author":"J.A. Tomlin","year":"1974","unstructured":"J.A. Tomlin, \u201cGeneralized upper bounding and triangular decomposition in the simplex method\u201d,Operations Research 22 (1974) 664\u2013668.","journal-title":"Operations Research"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02591889.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02591889\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02591889","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T19:37:50Z","timestamp":1558381070000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02591889"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,5]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1983,5]]}},"alternative-id":["BF02591889"],"URL":"https:\/\/doi.org\/10.1007\/bf02591889","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1983,5]]}}}