Letter to the Editor—Computing Two-Commodity Flows

B. Rothschild, A. Whinston and J. Kent
Additional contact information
B. Rothschild: Massachusetts Institute of Technology
A. Whinston: Purdue University
J. Kent: University of Virginia

Operations Research, 1968, vol. 16, issue 2, 446-450

Abstract: In Opns. Res. 14, 377–387 (1966) a max-flow min-cut theorem for two-commodity flows in Euler networks with integer capacities is proved. In this paper we describe an algorithm for constructing maximal two-commodity integer flows based on the proof in the reference cited, and we give computation times for some examples on a Burroughs B-5000 computer.

Date: 1968
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.16.2.446 (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:16:y:1968:i:2:p:446-450

Access Statistics for this article

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