Author:
Goldberg Andrew V.,Kennedy Robert
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference25 articles.
1. R.K. Ahuja, J.B. Orlin, C. Stein and R.E. Tarjan, “Improved algorithms for bipartite network flow,”SIAM Journal on Computing 23 (1994) 906–933.
2. R.J. Anderson and J.C. Setubal, “Goldberg's algorithm for the maximum flow in perspective: a computational study,” in: D.S. Johnson and C.C. McGeoch, eds.,Network Flows and Matching: First DIMACS Implementation Challenge (American Mathematical Society, Providence, RI, 1993) pp. 1–18.
3. D.P. Bertsekas, “The auction algorithm: a distributed relaxation method for the assignment problem,”Annals of Operations Research 14 (1988) 105–123.
4. D.P. Bertsekas,Linear Network Optimization: Algorithms and Codes (MIT Press, Cambridge, MA, 1991).
5. R.G. Bland, J. Cheriyan, D.L. Jensen and L. Ladańyi, “An empirical study of min cost flow algorithms,” in: D.S. Johnson and C.C. McGeoch, eds.,Network Flows and Matching: First DIMACS Implementation Challenge (American Mathematical Society, Providence, RI, 1993) pp. 119–156.
Cited by
81 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献