{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T09:22:43Z","timestamp":1746264163134},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1991,3,1]],"date-time":"1991-03-01T00:00:00Z","timestamp":667785600000},"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":[[1991,3]]},"DOI":"10.1007\/bf01594940","type":"journal-article","created":{"date-parts":[[2005,4,29]],"date-time":"2005-04-29T02:12:13Z","timestamp":1114740733000},"page":"277-290","source":"Crossref","is-referenced-by-count":41,"title":["Use of dynamic trees in a network simplex algorithm for the maximum flow problem"],"prefix":"10.1007","volume":"50","author":[{"given":"Andrew V.","family":"Goldberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael D.","family":"Grigoriadis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert E.","family":"Tarjan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"748","DOI":"10.1287\/opre.37.5.748","volume":"37","author":"R.K. Ahuja","year":"1989","unstructured":"R.K. Ahuja and J.B. Orlin, \u201cA fast and simple algorithm for the maximum flow problem,\u201dOperations Research 37 (1989) 748\u2013759.","journal-title":"Operations Research"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"939","DOI":"10.1137\/0218065","volume":"18","author":"R.K. Ahuja","year":"1989","unstructured":"R.K. Ahuja, J.B. Orlin and R.E. Tarjan, \u201cImproved time bounds for the maximum flow problem,\u201dSIAM Journal on Computing 18 (1989) 939\u2013954.","journal-title":"SIAM Journal on Computing"},{"key":"CR3","volume-title":"Linear Programming","author":"V. Chvatal","year":"1983","unstructured":"V. Chvatal,Linear Programming (Freeman, New York, 1983)."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF01580379","volume":"1","author":"W.H. Cunningham","year":"1976","unstructured":"W.H. Cunningham, \u201cA network simplex method,\u201dMathematical Programming 1 (1976) 105\u2013116.","journal-title":"Mathematical Programming"},{"key":"CR5","volume-title":"Linear Programming and Extensions","author":"G.L. Dantzig","year":"1963","unstructured":"G.L. Dantzig,Linear Programming and Extensions (Princeton University Press, Princeton, NJ, 1963)."},{"key":"CR6","first-page":"1277","volume":"11","author":"E.A. Dinic","year":"1970","unstructured":"E.A. Dinic, \u201cAlgorithm for solution of a problem of maximum flow in networks with power estimation,\u201dSoviet Mathematics Doklady 11 (1970) 1277\u20131280.","journal-title":"Soviet Mathematics Doklady"},{"key":"CR7","volume-title":"Flows in Networks","author":"L.R. Ford Jr.","year":"1962","unstructured":"L.R. Ford, Jr. and D.R. Fulkerson,Flows in Networks (Princeton University Press, Princeton, NJ, 1962)."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1002\/nav.3800020407","volume":"2","author":"D.R. Fulkerson","year":"1955","unstructured":"D.R. Fulkerson and G.B. Dantzig, \u201cComputations of maximal flows in networks,\u201dNaval Research Logistics Quarterly 2 (1955) 277\u2013283.","journal-title":"Naval Research Logistics Quarterly"},{"key":"CR9","volume-title":"\u201cA new max-flow algorithm,\u201d Technical Report MIT\/LCS\/TM-291","author":"A.V. Goldberg","year":"1985","unstructured":"A.V. Goldberg, \u201cA new max-flow algorithm,\u201d Technical Report MIT\/LCS\/TM-291, Laboratory for Computer Science, Massachusetts Institute of Technology (Cambridge, MA, 1985)."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"A.V. Goldberg","year":"1988","unstructured":"A.V. Goldberg and R.E. Tarjan, \u201cA new approach to the maximum flow problem,\u201dJournal of the Association of Computing Machinery 35 (1988) 921\u2013940.","journal-title":"Journal of the Association of Computing Machinery"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF02288321","volume":"13","author":"D. Goldfarb","year":"1988","unstructured":"D. Goldfarb and M.D. Grigoriadis, \u201cA computational comparison of the Dinic and network simplex methods for maximum flow,\u201dAnnals of Operations Research 13 (1988) 83\u2013123.","journal-title":"Annals of Operations Research"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF01580869","volume":"47","author":"D. Goldfarb","year":"1990","unstructured":"D. Goldfarb and J. Hao, \u201cA primal simplex algorithm that solves the maximum flow problem in at mostnm pivots and O(n 2 m) time,\u201d,Mathematical Programming 47 (1990) 353\u2013365.","journal-title":"Mathematical Programming"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BFb0121089","volume":"26","author":"M.D. Grigoriadis","year":"1986","unstructured":"M.D. Grigoriadis, \u201cAn efficient implementation of the primal simplex method,\u201dMathematical Programming Study 26 (1986) 83\u2013111.","journal-title":"Mathematical Programming Study"},{"key":"CR14","volume-title":"Algorithms for Network Programming","author":"J.L. Kennington","year":"1980","unstructured":"J.L. Kennington and R.V. Helgason,Algorithms for Network Programming (Wiley, New York, 1980)."},{"key":"CR15","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E.L. Lawler","year":"1976","unstructured":"E.L. Lawler,Combinatorial Optimization: Networks and Matroids (Holt, Reinhart, and Winston, New York, 1976)."},{"key":"CR16","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"C.H. Papadimitriou","year":"1982","unstructured":"C.H. Papadimitriou and K. Steiglitz,Combinatorial Optimization: Algorithms and Complexity (Prentice-Hall, Englewood Cliffs, NJ, 1982)."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/0022-0000(83)90006-5","volume":"26","author":"D.D. Sleator","year":"1983","unstructured":"D.D. Sleator and R.E. Tarjan, \u201cA data structure for dynamic trees,\u201dJournal of Computer and System Sciences 26 (1983) 362\u2013391.","journal-title":"Journal of Computer and System Sciences"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1145\/3828.3835","volume":"32","author":"D.D. Sleator","year":"1985","unstructured":"D.D. Sleator and R.E. Tarjan, \u201cSelf-adjusting binary search trees,\u201dJournal of the Association of Computing Machinery 32 (1985) 652\u2013686.","journal-title":"Journal of the Association of Computing Machinery"},{"key":"CR19","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970265","volume-title":"Data Structures and Network Algorithms","author":"R.E. Tarjan","year":"1983","unstructured":"R.E. Tarjan,Data Structures and Network Algorithms (Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983)."},{"key":"CR20","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1137\/0606031","volume":"6","author":"R.E. Tarjan","year":"1985","unstructured":"R.E. Tarjan, \u201cAmortized computational complexity,\u201dSIAM Journal on Algebraic and Discrete Methods 6 (1985) 306\u2013318.","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"CR21","doi-asserted-by":"crossref","unstructured":"R.E. Tarjan, \u201cEfficiency of the primal network simplex algorithm for the minimum-cost circulation problem,\u201d to appear in:Mathematics of Operations Research (1991).","DOI":"10.1287\/moor.16.2.272"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01594940.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01594940\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01594940","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:48:39Z","timestamp":1556898519000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01594940"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,3]]},"references-count":21,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1991,3]]}},"alternative-id":["BF01594940"],"URL":"https:\/\/doi.org\/10.1007\/bf01594940","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,3]]}}}