Skip to content
Notes on Linear Programming: Part XXXVII: Concerning Multicommodity Networks
Add to cart
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.