Minimize Traffic Congestion: An Application of Maximum Flow in Dynamic Networks
By: K. Kaanodiya and Mohd Rizwanullah
Open Access
|Aug 2012References
- Ahuja, R., Magnati, T., Orlin, J.,Prentice-Hall, Englewood Cliffs, 1993.
- Aronson, J.,Ann. Oper. Res., vol. 20, 1989, pp. 1-66. 395 M. A. Fonoberova, D. D. Lozovanu.
- Aumann, Y. And Rabani, Y. 1998. An(log) approximate min-cut max-flow theorem and approximation algorithm., 1, 291-301.
- Aronson, J. E., A survey of dynamic network flows,20 (1989) 1-66.
- Ford, L., Fulkerson, D.,Princeton University Press, Princeton, NJ, 1962.
- Ben-Akiva, M., A. de Palma and I. Kaysi (1991). Dynamic network models and driver information systems., 25A(5), 251-266.
- Dahlgren Lab of U. S. Navy,2001
- Ford, L., Fulkerson, D.,Operation Res., vol. 6, 1958, p. 419-433.
- Fleisher, L., Skutella, M.,, Springer, Berlin, 2002, p. 36-53.
- Fleischer, L.,, vol. 38, no. 3, 2001, pp. 115-125.
- G. Bretti, R. Natalini, and B. Piccoli, "Numerical algorithms for simulations of a traffic model on road networks",., 2007, 210, (1-2), pp. 71-77.
- Goldberg, A., Tarjan, R.,Journal of the Association for Computing Machinery, vol. 35, no. 4, 1988, pp. 921-940.
- Garg, N., Vazarani, V., And Yannakakis, M. 1996. Approximate max-flow min-(multi) cut theorems and their applications., 235-251.
- Hoppe, B. and Tardos, E., The quickest transsipment problem,25 (2000) 36-62.
- Hoppe, B., Tardos, E.,, vol. 25, 2000, p. 36-62.
- Kohler, E. and Skutella, M., Flows over time with load-dependent transit times,(2002) 174-183.
- Kumar, S., Gupta, P.,Journal of Mathematical Modeling and Algorithms. vol. 2, 2003, pp. 1-16.
- Leighton, F. T., Makedon, F., Plotkin, S., Stein, C., Tardos, E., And Tragoudas, S. 1992. Fast approximation algorithms for multi-commodity flow problems., 228-243.
- Lindsey, R. and E. T. Verhoef (2000). Congestion modeling. Forthcoming in:. (D. A. Hensher and K. J. Button, eds.), Elsevier Science, Oxford.
- Lozovanu, D., Stratila, D.,(Edited by V. Barbu, I. Lesiencko), ISBN 1-4020-7439-5. Klnwer Academic Publissers, 2003, p. 247-258.
- Lozovanu, D., Stratila, D.,Bul. Acad. Stiinte Repub. Mold., Mat., vol. 3, 2001, p. 38-56.
- Laih, C-H. (1994). Queuing at a bottleneck with single- and multi-step tolls., 28A(3), 197-208.
- Maria A. Fonoberova, Dmitrii D. Lozovanu, "The maximum flow in dynamic networks",, vol.12, no.3 (36), 2004.
- Mazzoni, G., Pallottino, S., Scutella, M.,European Journal of Operational Research, vol. 53, 1991, pp. 257-278.
- Minieka, E., Dynamic network flows with arc changes,4 (1974) 255-265.
- Powell, W. B., Jaillet, P. and Odoni, A., Stochastic and dynamic networks and routing, In:
- Routing, Vol. 8 (1995) of, Chapter 3 141-295.
- Shahrokhi, F. And Matula, D. W. 1990. The maximum concurrent flow problem., 318-334.
- Wikipedia, "Traffic Congestion", Available:
DOI: https://doi.org/10.2478/v10294-012-0007-1 | Journal eISSN: 1339-0015 (formerly 1336-9180) | Journal ISSN: 1336-9180
Language: English
Page range: 63 - 74
Published on: Aug 13, 2012
Published by: University of Ss. Cyril and Methodius in Trnava
In partnership with: Paradigm Publishing Services
Keywords:
Related subjects:
© 2012 K. Kaanodiya, Mohd Rizwanullah, published by University of Ss. Cyril and Methodius in Trnava
This work is licensed under the Creative Commons License.