Part of the Modern Birkhäuser Classics book series (MBC)
A Theorem on Flows in Networks
The theorem to be proved in this note is a generalization of a well-known combinatorial theorem of P. Hall, .
KeywordsAggregate Demand Nonnegative Real Number Rand Corporation Capacity Function Dual Sequence
Unable to display preview. Download preview PDF.
- 1.G. B. Dantzig and D. R. Fulkerson, On the ma.x-flow min-cut theorem of networks,Ann. of Math. Study No. 38, Contributions to linear inequalities and related topics,edited by H. W. Kuhn and A. W. Tucker, 215-221.Google Scholar
© Birkhäuser Boston, a part of Springer Science+Business Media, LLC 2009