Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference64 articles.
1. Goldberg, A.V., Tardos, E., Tarjan, R.E.: Network flow algorithms. In: Korte, B., Lovasz, L., Promel, H.J., Schrijver, A. (eds.) Flows, Paths and VLSI, pp. 101–164. Springer, Berlin (1990)
2. Jewell, W.S.: Optimal flow through networks with gains. Oper. Res. 10, 476–499 (1962)
3. Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)
4. Klein, M.: A primal method for minimal cost flows with applications to the assignment and transportation problems. Manag. Sci. 14, 205–220 (1967)
5. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Upper Saddle River (1993)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献