A Suggested Computation for Maximal Multi-Commodity Network Flows

References

• Dantzig G. B. , Fulkerson D. R. Computation of maximal flows in networks. Naval Res. Logist. Quart. (1955) 2 4Google Scholar
• Ford L. R. The RAND Corporation Paper P-923. Network Flow Theory (1956) August 14 Google Scholar
• Ford L. R. , Fulkerson D. R. Maximal flow through a network. Canad. J. Math. (1956) 8 399 404Crossref, Google Scholar
• Ford L. R. , Fulkerson D. R. A simple algorithm for finding maximal network flows and an application to the Hitchcock problem. Canad. J. Math. (1957) 9 210 218Crossref, Google Scholar
• Kalaba R. E. , Juncosa M. L. Optimal design and utilization of communication networks. Management Sci. (1956) 3 1Link, Google Scholar
• Orden A. The transshipment problem. Management Sci. (1956) 2 3Link, Google Scholar