On Two Commodity Network Flows

B. Rothschild and A. Whinston
Additional contact information
B. Rothschild: Yale University, New Haven, Connecticut
A. Whinston: University of Virginia, Charlottesville, Virginia

Operations Research, 1966, vol. 14, issue 3, 377-387

Abstract: The paper considers the problem of two-commodity network flows and generalizes a result of Hu on integral flows in networks with integral capacities. The main result of the paper is a max-flow min-cut theorem for two commodity networks. The method of proof involves a particular type of separation process. This leads to an algorithm for finding the maximal flows. Several counterexamples to certain possible generalizations are given at the end of the paper.

Date: 1966
References: Add references at CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.14.3.377 (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:14:y:1966:i:3:p:377-387

Access Statistics for this article

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