Multi-Commodity Network Flows

T. C. Hu
Additional contact information
T. C. Hu: IBM Research Center, Yorktown Heights, New york

Operations Research, 1963, vol. 11, issue 3, 344-360

Abstract: A network is a set of nodes N ı connected by arcs with nonnegative arc capacities b ıj which indicates the maximum amount of flow that can pass through the arc from N ı to N j . Given all b ıj , there is a maximum flow from N ı to N j using all arcs. Under the assumption that b ıj = b jı , the present paper generalizes the max-flow min-cut theorem of Ford and Fulkerson to the problem of finding the maximum simultaneous flows of two commodities and gives an algorithm similar to the labelling method for constructing the two flows.

Date: 1963
References: Add references at CitEc
Citations: View citations in EconPapers (19)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.11.3.344 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:11:y:1963:i:3:p:344-360

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().