Abstract
The minimum cost flow problem and the maximum flow problem on networks with time-dependent characteristics and nonlinear cost functions on arcs are considered. The algorithms for determining optimal solutions of the single-commodity and multicommodity network flow problems based on the time-expanded network method are elaborated. Some applications of the optimal flow problems are provided.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ahuja, R., Magnati, T., Orlin, J.: Network flows. Prentice-Hall, Englewood Cliffs (1993)
Altman, E., Boulogne, T., El-Azouzi, R., Jimenez, T., Wynter, L.: A survey on networking games in telecommunications. Computers and Operations Research. 33(2), 286-311 (2006).
Aronson, J.: A survey of dynamic network flows. Ann. Oper. Res. 20, 1–66 (1989)
Assad, A.: Multicommodity network flows: A survey. Networks. 8, 37–92 (1978)
Bland, R.G., Jensen, D.L.: On the computational behavior of a polynomial-time network flow algorithm. Technical Report 661, School of Operations Research and Industrial Engineering, Cornell University (1985)
Cai, X., Sha, D., Wong, C.K.: Time-varying minimum cost flow problems. European Journal of Operational Research. 131, 352–374 (2001)
Carey, M., Subrahmanian, E.: An approach to modelling time-varying flows on congested networks. Transportation Research Part B. 34, 157–183 (2000)
Castro J.: A specialized interior-point algorithm for multicommodity network flows. Siam J. Optim. 10(3), 852–877 (2000)
Castro, J.: Solving difficult multicommodity problems with a specialized interior-point algorithm. Annals of Operations Research. 124, 35–48 (2003)
Castro, J., Nabona, N.: An implementation of linear and nonlinear multicommodity network flows. European Journal of Operational Research Theory and Methodology. 92, 37–53 (1996)
Cherkasskij, B.V.: Algorithm for construction of maximal flow in networks with complexity of \(0({V }^{2}\sqrt{E})\) operations. Math. Methods Sol. Econ. Probl. 7, 112–125 (1977)
Christofides, N.: Graph theory. An algorithmic approach. Academic Press, New York, London, San Francisco (1975)
Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. J. Assoc. Comput. Mach. 19, 248–264 (1972)
Ermoliev, Iu., Melnic, I.: Extremal problems on graphs. Naukova Dumka, Kiev (1968)
Fleisher, L.: Approximating multicommodity flow independent of the number of commodities. Siam J. Discrete Math. 13(4), 505–520 (2000)
Fleischer, L.: Universally maximum flow with piecewise-constant capacities. Networks. 38(3), 115–125 (2001)
Fleischer, L.: Faster algorithms for the quickest transshipment problem. Siam J. Optim. 12(1) 18–35 (2001)
Fleisher, L., Skutella, M.: The quickest multicommodity flow problem. Integer programming and combinatorial optimization. Springer, Berlin, 36–53 (2002)
Fonoberova, M., Lozovanu, D.: Minimum cost multicommodity flows in dynamic networks and algorithms for their finding. The Bulletin of Academy of Sciences of Moldova, Mathe-matics. 1(53), 107–119 (2007)
Ford, L., Fulkerson, D.: Constructing maximal dynamic flows from static flows. Operation Res. 6, 419–433 (1958)
Ford, L., Fulkerson, D.: Flows in Networks. Princeton University Press, Princeton, NJ (1962)
Gabow, H.N.: Scaling algorithms for network problems. J. Comput. Syst. Sci. 31, 148–168 (1985)
Glockner, G., Nemhauser, G.: A dynamic network flow problem with uncertain arc capacities: formulation and problem structure. Operations Research. 48(2), 233–242 (2000)
Goldberg, A.: An efficient implementation of a scaling minimum cost flow algorithm. J. Algorithms. 22(1), 1–29 (1997)
Goldberg, A.V., Tarjan, R.E.: Solving minimum-cost flow problems by successive approximation. Proc. 19th ACM STOC. 7–18 (1987)
Goldberg, A.V., Tarjan, R.E.: Finding minimum-cost circulations by canceling negative cycles. Technical Report CS-TR 107-87, Department of Computer Science, Princeton University (1987)
Goldberg, A., Tarjan, R.: A new approach to the maximum-flow problem. Journal of the Association for Computing Machinery. 35(4), 921–940 (1988)
Goljshtein, E., Iudin, D.: Linear programming problems of transport type. Nauka, Moscow (1969)
Hoffman, A.: Some recent applictions of the theory of linear inequalities to extremal combinatorial analysis. Proc. Symposia on Applied Math. 10 (1960)
Hoppe, B., Tardos, E.: The quickest transshipment problem. Mathematics of Operations Research. 25, 36–62. (2000)
Hu, T.: Integer programming and network flows. Addison-Wesley Publishing Company, Reading, Massachusetts, Menlo Park, California London Don Mills, Ontario (1970)
Klinz, B., Woeginger, C.: Minimum cost dynamic flows: the series parallel case. Integer programming and combinatorial optimization (Copenhagen, 1995). Springer, Berlin, 329–343 (1995)
Klinz, B., Woeginger, C.: One, two, three, many, or: complexity aspects of dynamic network flows with dedicated arcs. Operations Research Letters. 22, 119–127 (1998)
Kumar, S., Gupta, P.: An incremental algorithm for the maximum flow problem. Journal of Mathematical Modelling and Algorithms. 2, 1–16 (2003)
Lazar, A., Orda, A., Dimitrios, E.: Virtual path bandwidth allocation in multiuser networks. IEEE/ACM transaction on networking. 5(6), 861–871 (1997)
Lozovanu, D.: Extremal-combinatorial problems and algorithms for their solving. Stiinta, Chisinau (1991)
Lozovanu, D., Fonoberova, M.: Optimal Flows in Dynamic Networks, Chisinau, CEP USM (2006)
Lozovanu, D., Pickl, S.: Pareto-Nash equilibrium for multiobjective games. European Journal of Operational Research. 181, 1214–1232 (2007)
Lozovanu, D., Stratila, D.: The minimum cost flow problem on dynamic networks and algorithm for its solving. Bul. Acad. Ştiinţe Repub. Mold., Mat. 3, 38–56 (2001)
Lozovanu, D., Stratila, D.: Optimal flow in dynamic networks with nonlinear cost functions on edges. Analysis and optimization of differential systems. Kluwer Academic Publishers, 247–258 (2003)
Ma, Z., Cui, D., Cheng, P.: Dynamic network flow model for short-term air traffic flow management. IEEE Transactions on Systems, Man, and Cybernetics – Part A: Systems and Humans. 34(3), 351–358 (2004)
MacKie-Mason, J., Varian, H.: Pricing congestible network resources. IEEE Journal of selected areas in communications. 13(7), 1141–1149 (1995)
Mazzoni, G., Pallottino, S., Scutella, M.: The maximum flow problem: A max-preflow approach. European Journal of Operational Research. 53, 257–278 (1991)
McBride, R.: Progress made in solving the multicommodity flow problems. Siam J. Optim. 8(4), 947–955 (1998)
Nash, J.: Non cooperative games. Annals of Mathematics. 2, 286–295 (1951)
Papadimitrou, C., Steiglitz, K.: Combinatorial optimization: algorithms and complexity. Prentice-Hall Inc., Englewood Cliffs, N.J. (1982)
Powell, W., Jaillet, P., Odoni, A.: Stochastic and dynamic networks and routing. In: M. O. Ball, T. L. Magnanti, C. L. Monma, and G. L. Nemhauser, (eds.) Network Routing, volume 8 of Handbooks in Operations Research and Management Science, chapter 3, pp. 141–295. North Holland, Amsterdam, The Netherlands (1995)
Tarjan, R.E.: A simple version of Karzanov’s blocking flow algorithm. Oper. Res. Lett. 2, 265–268 (1984)
Acknowledgements
I express my gratitude to Dmitrii Lozovanu for close collaboration.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Fonoberova, M. (2012). Optimal Flows in Dynamic Networks and Algorithms for their Finding. In: Thai, M., Pardalos, P. (eds) Handbook of Optimization in Complex Networks. Springer Optimization and Its Applications(), vol 57. Springer, Boston, MA. https://doi.org/10.1007/978-1-4614-0754-6_13
Download citation
DOI: https://doi.org/10.1007/978-1-4614-0754-6_13
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4614-0753-9
Online ISBN: 978-1-4614-0754-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)