{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T04:46:22Z","timestamp":1768884382601,"version":"3.49.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"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":[[1992,1]]},"DOI":"10.1007\/bf01585705","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:34:23Z","timestamp":1114677263000},"page":"243-266","source":"Crossref","is-referenced-by-count":71,"title":["Finding minimum-cost flows by double scaling"],"prefix":"10.1007","volume":"53","author":[{"given":"Ravindra K.","family":"Ahuja","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew V.","family":"Goldberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James B.","family":"Orlin","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":"939","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) 939\u2013954.","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","series-title":"unpublished working paper","volume-title":"A distributed algorithm for the assignment problem","author":"D.P. Bertsekas","year":"1979","unstructured":"D.P. Bertsekas, \u201cA distributed algorithm for the assignment problem,\u201d unpublished working paper, Laboratory for Information and Decision Science, M.I.T. (Cambridge, MA, 1979)."},{"key":"CR4","volume-title":"\u201cDistributed asynchronous relaxation methods for linear network flow problems,\u201d Technical Report LIDS-P-1606","author":"D.P. Bertsekas","year":"1986","unstructured":"D.P. Bertsekas, \u201cDistributed asynchronous relaxation methods for linear network flow problems,\u201d Technical Report LIDS-P-1606, Laboratory for Information and Decision Sciences, M.I.T. (Cambridge, MA, 1986)."},{"key":"CR5","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":"CR6","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J. Edmonds","year":"1972","unstructured":"J. Edmonds and R.M. Karp, \u201cTheoretical improvements in algorithmic efficiency for network flow problems,\u201dJournal of the Association on Computing Machinery 19 (1972) 248\u2013264.","journal-title":"Journal of the Association on Computing Machinery"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/0022-0000(85)90039-X","volume":"31","author":"H.N. Gabow","year":"1985","unstructured":"H.N. Gabow, \u201cScaling algorithms for network problems,\u201dJournal of Computer and System Sciences 31 (1985) 148\u2013168.","journal-title":"Journal of Computer and System Sciences"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1137\/0218069","volume":"18","author":"H.N. Gabow","year":"1989","unstructured":"H.N. Gabow and R.E. Tarjan, \u201cFaster scaling algorithms for networks problems,\u201dSIAM Journal on Computing 18 (1989) 1013\u20131036.","journal-title":"SIAM Journal on Computing"},{"key":"CR9","volume-title":"Efficient graph algorithms for sequential and parallel computers","author":"A.V. Goldberg","year":"1987","unstructured":"A.V. Goldberg, \u201cEfficient graph algorithms for sequential and parallel computers,\u201d Ph.D. Thesis, M.I.T. (Cambridge, MA, 1987)."},{"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 for Computing Machinery 35 (1988) 921\u2013940.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1287\/moor.15.3.430","volume":"15","author":"A.V. Goldberg","year":"1990","unstructured":"A.V. Goldberg and R.E. Tarjan, \u201cFinding minimum-cost circulations by successive approximation,\u201dMathematics of Operations Research 15 (1990) 430\u2013466.","journal-title":"Mathematics of Operations Research"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1145\/76359.76368","volume":"36","author":"A.V. Goldberg","year":"1989","unstructured":"A.V. Goldberg and R.E. Tarjan, \u201cFinding minimum-cost circulations by canceling negative cycles,\u201dJournal of the Association for Computing Machinery 36 (1989) 873\u2013886; alsoProceedings of the Twentieth Annual ACM Symposium on Theory of Computing (1988), 388\u2013397.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"CR13","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":"CR14","volume-title":"Data Structures and Algorithms, Vol. 1: Sorting and Searching","author":"R. Melhorn","year":"1984","unstructured":"R. Melhorn,Data Structures and Algorithms, Vol. 1: Sorting and Searching (Springer, Berlin, 1984)."},{"key":"CR15","first-page":"166","volume":"23","author":"J.B. Orlin","year":"1985","unstructured":"J.B. Orlin, \u201cOn the simplex algorithm for networks and generalized networks,\u201dMathematical Programming 23 (1985) 166\u2013178.","journal-title":"Mathematical Programming"},{"key":"CR16","doi-asserted-by":"crossref","unstructured":"J. Orlin, \u201cA faster strongly polynomial minimum cost flow algorithm,\u201dProceedings of the Twentieth Annual ACM Symposium on Theory of Computing (1988) 377\u2013387.","DOI":"10.21236\/ADA457044"},{"key":"CR17","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, N.J, 1982)."},{"key":"CR18","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":"CR19","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 for Computing Machinery 32 (1985) 652\u2013686.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"CR20","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF02579369","volume":"5","author":"E. Tardos","year":"1985","unstructured":"E. Tardos, \u201cA strongly polynomial minimum cost circulation algorithm,\u201dCombinatorica 5 (1985) 247\u2013255.","journal-title":"Combinatorica"},{"key":"CR21","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":"CR22","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1137\/0217010","volume":"17","author":"R.E. Tarjan","year":"1988","unstructured":"R.E. Tarjan and C.J. van Wyk, \u201cAn O(n log logn)-time algorithm for triangulating a simple polygon,\u201dSIAM Journal on Computing 17 (1988) 143\u2013178.","journal-title":"SIAM Journal on Computing"},{"key":"CR23","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1287\/mnsc.5.3.304","volume":"5","author":"H.M. Wagner","year":"1959","unstructured":"H.M. Wagner, \u201cOn a class of capacitated transportation problems,\u201dManagement Science 5 (1959) 304\u2013318.","journal-title":"Management Science"},{"key":"CR24","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF01580132","volume":"5","author":"N. Zadeh","year":"1973","unstructured":"N. Zadeh, \u201cA bad network flow problem for the simplex method and other minimum cost flow algorithms,\u201dMathematical Programming 5 (1973) 255\u2013266.","journal-title":"Mathematical Programming"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01585705.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01585705\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01585705","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:32:30Z","timestamp":1556897550000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01585705"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,1]]},"references-count":24,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1992,1]]}},"alternative-id":["BF01585705"],"URL":"https:\/\/doi.org\/10.1007\/bf01585705","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,1]]}}}