Letter to the Editor—Computing Two-Commodity Flows
Published Online:1 Apr 1968https://doi.org/10.1287/opre.16.2.446
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.
