Presented at The RAND Symposium on Mathematical Programming, Santa Monica, California, March 16–20, 1959.
On network flow functions†
Article first published online: 1 AUG 2006
Copyright © 1961 Wiley Periodicals, Inc., A Wiley Company
Naval Research Logistics Quarterly
Volume 8, Issue 2, pages 151–158, June 1961
How to Cite
Shapley, L. S. (1961), On network flow functions. Naval Research Logistics, 8: 151–158. doi: 10.1002/nav.3800080204
- Issue published online: 1 AUG 2006
- Article first published online: 1 AUG 2006
- Manuscript Received: 10 FEB 1961
- Cited By
This article covers an investigation of the capacity of a network as a function of the capacities of its individual arcs. The case of two variables was investigated in detail, and it was found that each pair of arcs either consistently help each other or consistently hinder each other. Interaction types were computed for a number of special cases, such as arcs in parallel or arcs in series.