Table of Contents Author Guidelines Submit a Manuscript
Advances in Operations Research
Volume 2016 (2016), Article ID 7902460, 7 pages
http://dx.doi.org/10.1155/2016/7902460
Research Article

Continuous Time Dynamic Contraflow Models and Algorithms

Central Department of Mathematics, Tribhuvan University, P.O. Box 13143, Kathmandu, Nepal

Received 10 September 2015; Accepted 6 March 2016

Academic Editor: Konstantina Skouri

Copyright © 2016 Urmila Pyakurel and Tanka Nath Dhamala. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. S. Kim, S. Shekhar, and M. Min, “Contraflow transportation network reconfiguration for evacuation route planning,” IEEE Transactions on Knowledge and Data Engineering, vol. 20, no. 8, pp. 1115–1129, 2008. View at Publisher · View at Google Scholar · View at Scopus
  2. S. Rebennack, A. Arulselvan, L. Elefteriadou, and P. M. Pardalos, “Complexity analysis for maximum flow problems with arc reversals,” Journal of Combinatorial Optimization, vol. 19, no. 2, pp. 200–216, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  3. R. E. Burkard, K. Dlaska, and B. Klinz, “The quickest flow problem,” Zeitschrift für Operations Research, vol. 37, no. 1, pp. 31–58, 1993. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  4. T. N. Dhamala and U. Pyakurel, “Earliest arrival contraflow problem on series-parallel graphs,” International Journal of Operations Research, vol. 10, no. 1, pp. 1–13, 2013. View at Google Scholar · View at MathSciNet
  5. U. Pyakurel and T. N. Dhamala, “Models and algorithms on contraflow evacuation planning network problems,” International Journal of Operations Research, vol. 12, no. 2, pp. 36–46, 2015. View at Google Scholar · View at MathSciNet
  6. R. C. Dhungana, U. Pyakurel, S. R. Khadka, and T. N. Dhamala, “Universally maximum contraflow for evacuation planning,” International Journal of Operations Research, vol. 4, pp. 67–78, 2015. View at Google Scholar
  7. U. Pyakurel and T. N. Dhamala, “Evacuation planning by earliest arrival contraflow,” Journal of Industrial and Management Optimization, 2015. View at Google Scholar
  8. B. Kotnyek, An Annotated Overview of Dynamic Network Flows, INRIA, Sophia Antipolis, France, 2004.
  9. L. K. Fleischer and E. Tardos, “Efficient continuous-time dynamic network flow algorithms,” Operations Research Letters, vol. 23, no. 3–5, pp. 71–80, 1998. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  10. F. R. Ford and D. R. Fulkerson, Flows in Networks, Princeton University Press, Princeton, NJ, USA, 1962.
  11. L. R. Ford Jr. and D. R. Fulkerson, “Constructing maximal dynamic flows from static flows,” Operations Research, vol. 6, pp. 419–433, 1958. View at Publisher · View at Google Scholar · View at MathSciNet
  12. E. J. Anderson, P. Nash, and A. B. Philpott, “A class of continuous network flow problems,” Mathematics of Operations Research, vol. 7, no. 4, pp. 501–514, 1982. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  13. S. Ruzika, H. Sperber, and M. Steiner, “Earliest arrival flows on series-parallel graphs,” Networks, vol. 57, no. 2, pp. 169–173, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. B. E. Hoppe, Efficient dynamic network flow algorithms [Ph.D. thesis], Cornell University, 1995.