Abstract
We consider the two-commodity flow problem and give a good characterization of the optimum flow if the augmented network (with both source-sink edges added) is planar. We show that max flow ≧ min cut −1, and describe the structure of those networks for which equality holds.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
G. M. Adelson-Velski, E. A. Dinitz andA. V. Karzanov,Algorithms for Flows in Networks (in Russian), Nauka, Moscow, 1975.
B. V. Cherkasski, On Multiterminal Two-commodity Network Flow Problems, In:Issledovaniya po Diskretnoi Optimizacii (in Russian), Nauka, Moscow, 1976, 261–289.
S. V. Even, A. Itai andA. Shamir, On the complexity of the timetable and multicommodity flow problem,SIAM J. Comput.,5 (4) (1976).
L. R. Ford andD. R. Fulkerson,Flows in Networks, Princeton, 1962.
T. C. Hu,Integer Programming and Network Flow, Addison—Wesley, Reading, Mass., 1970.
A. V. Karzanov andM. V. Lomonosov, Multiflows in Undirected Networks, In:Mathematical Programming. The Problems of Social and Economic Systems, Operations Research Models 1 (in Russian) The Institute for Systems Studies, Moscow, 1978.
P. D. Seymour, The Matroids with the Max-flow Min-cut Property.J. Comb. Theory Ser. B. 23 (1977) 189–222.