Abstract
We address the two-commodity maximum flow problem on undirected networks. As a result of a change of variables, we introduce a new formulation that solves the problem through classical maximum flow techniques with only one-commodity. Therefore, a general strategy, based on this change of variables, is defined to deal with other undirected multi-commodity problems. Finally, we extend the single objective problem to a bicriteria environment. We show that the set of efficient solutions of the biobjective undirected two-commodity maximum flow problem is the set of alternative optimum solutions of the undirected two-commodity maximum flow problem. In addition, we prove that the set of efficient extreme points in the objective space has, at most, cardinality two.
Similar content being viewed by others
References
Ahuja, R., Magnanti, T., Orlin, J.B.: Network Flows. Prentice-Hall, Englewood Cliffs (1993)
Costa, M., Letocart, L., Roupin, F.: Minimal multicut and maximal integer multiflow: A survey. Eur. J. Oper. Res. 162(1), 55–69 (2005)
Dinic, E.A.: Algorithms for solution of a problem of maximum flow in networks with power estimation. Sov. Math. Dokl. 11, 1277–1280 (1970)
Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency of network flow problems. J. ACM 19, 248–264 (1972)
Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Can. J. Math. 8, 399–404 (1956)
Goldberg, A.V., Rao, S.: Beyond the flow decomposition barrier. J. ACM 45(5), 783–797 (1998)
Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum-flow problem. J ACM 35(4), 921–940 (1988)
Hu, T.C.: Multi-commodity network flows. Oper. Res. 11, 344–360 (1963)
Itai, A.: Two-commodity flow. J. ACM 25(4), 596–611 (1978)
Rajagopalan, S.: Two-commodity flows. Oper. Res. Lett. 15, 151–156 (1994)
Rothschild, B., Whinston, A.: On two commodity network flows. Oper. Res. 14, 377–387 (1966)
Sakarovitch, M.: Two commodity network flows and linear programming. Math. Program. 4, 1–20 (1973)
Seymour, P.D.: A two commodity cut theorem. Discrete Math. 23, 177–181 (1978)
Steuer, R.E.: Multiple Criteria Optimization: Theory, Computation, and Application. Wiley Series in Probability and Mathematical Statistics. Wiley-Interscience, New York (1986)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Sedeño-Noda, A., González-Martín, C. & Alonso-Rodríguez, S. A new strategy for the undirected two-commodity maximum flow problem. Comput Optim Appl 47, 289–305 (2010). https://doi.org/10.1007/s10589-008-9214-5
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10589-008-9214-5