Notes on Linear Programming: Part XXXVII
Concerning Multicommodity Networks
A generalization of the minimum-cut, maximum-flow theorem to multicommodity networks. The generalization is expressed as a decomposition theorem that is established for these networks.
Robacker, John T., Notes on Linear Programming: Part XXXVII: Concerning Multicommodity Networks. Santa Monica, CA: RAND Corporation, 1956. https://www.rand.org/pubs/research_memoranda/RM1799.html. Also available in print form.
Robacker, John T., Notes on Linear Programming: Part XXXVII: Concerning Multicommodity Networks, Santa Monica, Calif.: RAND Corporation, RM-1799, 1956. As of January 13, 2022: https://www.rand.org/pubs/research_memoranda/RM1799.html