Abstract
This paper shows that the linear programming formulation of the two-commodity network flow problem leads to a direct derivation of the known results concerning this problem. An algorithm for solving the problem is given which essentially consists of two applications of the Ford—Fulkerson max flow computation. Moreover, the algorithm provides constructive proofs for the results. Some new facts concerning feasible integer flows are also given.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
L.R. Ford Jr. and D.R. Fulkerson,Flows in networks (Princeton University Press, Princeton, N.J., 1962).
T.C. Hu, “Multi-commodity network flows,”Operations Research 11 (1963) 344–360.
B. Rothschild and A. Whinston, “On two-commodity network flows,”Operations Research 14 (1966) 377–387.
B. Rothschild and A. Whinston, “Feasibility of two commodity network flows,”Operations Research 14 (1966) 1121–1124.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Sakarovitch, M. Two commodity network flows and linear programming. Mathematical Programming 4, 1–20 (1973). https://doi.org/10.1007/BF01584644
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01584644