Publisher
Springer International Publishing
Reference9 articles.
1. Ahuja, R., Magnanti, T., & Orlin, J. (1993 ). Network flows: Theory, algorithms, and applications. Englewood Cliffs: Prentice Hall.
2. Bellman, R. (1957 ). Dynamic programming. Princeton: Princeton University Press.
3. Dijkstra, E. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1, 269–271.
4. Elias, P., Feinstein, A., & Shannon, C. (1956). Note on maximum flow through a network. IRE Transactions on Information Theory, IT-2, 117–119.
5. Ford, L., & Fulkerson, D. (1956). Maximal flow through a network. Canadian Journal of Mathematics, 8, 399–404.