论文信息 - Optimal flows in networks with multiple sources and sinks

Optimal flows in networks with multiple sources and sinks

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.

Nimrod Megiddo | N. Megiddo

[1] T. C. Hu,et al. Multi-Terminal Network Flows , 1961 .

[2] D. R. Fulkerson,et al. A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem , 1957, Canadian Journal of Mathematics.

[3] S. Akers. The Use of Wye-Delta Transformations in Network Simplification , 1960 .