Optimal flows in networks with multiple sources and sinks
- Cite this article as:
- Megiddo, N. Mathematical Programming (1974) 7: 97. doi:10.1007/BF01585506
- 357 Downloads
The concept of an optimal flow in a multiple source, multiple sink network is defined. It generalizes maximal flow in a single source, single sink network. An existence proof and an algorithm are given.
© The Mathematical Programming Society 1974