Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Cheng, C.K., Hu, T.C.: Maximum concurrent flows and minimum cuts. Algorithmica 8, 233–249 (1992)
2. Ford, L.R., Fulkerson, D.R.: A suggested computation for maximum multi-commodity network flows. Manag. Sci. 5, 97–101 (1958)
3. Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)
4. Fulkerson, D.R.: Increasing the capacity of a network: the parametric budget problem. Manag. Sci. 5, 472–483 (1959)
5. Gomory, R.E., Hu, T.C.: Multi-terminal network flows. J. Soc. Ind. Appl. Math. 9, 551–570 (1961)