| 期刊論文| 1. | Orlin, J. B.(1993)。A Faster Strongly Polynomial Minimum Cost Flow Algorithm。Operations Research，41(2)，338-350。   | | 2. | Sherali, H. D.、Carter, T. B.、Hobeika, A. G.(1991)。A location-allocation model and algorithm for evacuation planning under hurricane/flood conditions。Transportation Research Part B: Methodological，25(6)，439-452。 | | 3. | Burkard, R. E.、Dlaska, K.、Klinz, B.(1993)。The quickest flow problem。Zeitschrift Für Operations Research: Methods and Models of Operations Research，37(1)，31-58。 | | 4. | Dhamala, Tanka Nath、Pyakurel, Urmila(20130300)。Earliest Arrival Contraflow Problem on Series-Parallel Graphs。International Journal of Operations Research，10(1)，1-13。 | | 5. | Fleischer, L. K.、Tardos, E.(1998)。Efficient continuous-time dynamic network flow algorithms。Operations Research Letters，23(3-5)，71-80。 | | 6. | Dhamala, Tanka Nath、Pyakurel, Urmila、Dempe, Stephan(20180900)。A Critical Survey on the Network Optimization Algorithms for Evacuation Planning Problems。International Journal of Operations Research，15(3)，101-133。 | | 7. | Goerigk, M.、Deghdak, K.、Heßler, P.(2014)。A comprehensive evacuation planning model and genetic soution algorithm。Transportation Research, Part E，71，82-97。 | | 8. | Goerigk, M.、Grün, B.、Heßler, P.(2014)。Combining bus evacuation with location decisions: A branch-and-price approach。Transportation Research Procedia，2，783-791。 | | 9. | Heßler, P.、Hamacher, H.(2016)。Sink location to find optimal shelters in evacuation planning。EURO Journal on Computational Optimization，4(3/4)，325-347。 | | 10. | Kim, S.、Shekhar, S.、Min, M.(2008)。Contraflow transportation network reconfiguration for evacuation route planning。IEEE Transactions on Knowledge and Data Engineering，20(8)，1115-1129。 | | 11. | Ng, M. W.、Park, J.、Waller, S. T.(2010)。A hybrid bilevel model for the optimal shelter assignment in emergency evacuations。Computer-Aided Civil and Infrastructure Engineering，25(8)，547-556。 | | 12. | Pyakurel, Urmila、Dhamala, Tanka Nath(20150600)。Models and Algorithms on Contraflow Evacuation Planning Network Problems。International Journal of Operations Research，12(2)，36-46。 | | 13. | Pyakurel, U.、Dhamala, T. N.(2016)。Continuous time dynamic contraflow models and algorithms。Advances in Operations Research，2016，(7902460)1-(7902460)7。 | | 14. | Pyakurel, U.、Dhamala, T. N.(2017)。Continuous dynamic contraflow approach for evacuation planning。Annals of Operations Research，253(1)，573-598。 | | 15. | Pyakurel, U.、Dhamala, T. N.(2017)。Evacuation planning by earliest arrival contraflow。Journal of Industrial & Management Optimization，13(1)，487-503。 | | 16. | Pyakurel, U.、Nath, H. N.、Dhamala, T. N.(2018)。Efficient contraflow algorithms for quickest evacuation planning。Science China Mathematics，61(11)，2079-2100。 | | 17. | Pyakurel, U.、Nath, H.、Dhamala, T.(2019)。Partial contraflow with path reversals for evacuation planning。Annals of Operations Research，283(1/2)，591-612。 | | 18. | Rebennack, S.、Arulselvan, A.、Elefteriadou, L.、Pardalos, P.(2010)。Complexity analysis for maximum flow problems with arc reversals。Journal of Combinatorial Optimization，19(2)，200-216。 | | 19. | Saho, M.、Shigeno, M.(2017)。Cancel-and-tighten algorithm for quickest flow problems。Networks，69(2)，179-188。 | | 20. | Wang, J. W.、Wang, H. F.、Zhang, W. J.、Ip, W. H.、Furuta, K.(2013)。Evacuation planning based on the contraflow technique with consideration of evacuation priorities and traffic setup time。IEEE Transactions on Intelligent Transportation Systems，14(1)，480-485。 | | 21. | Zhao, X.、Feng, Z.-Y.、Li, Y.、Bernard, A.(2016)。Evacuation network optimization model with lane-based reversal and routing。Mathematical Problems in Engineering，2016，(1273508)1-(1273508)12。 | | 22. | Kongsomsaksakul, S.、Yang, C.、Chen, A.(2005)。Shelter Location-allocation Model for Flood Evacuation Planning。Journal of the Eastern Asia Society for Transportation Studies，6，4237-4252。 | 會議論文| 1. | Lin, M.、Jaillet, P.(2015)。On the quickest flow problem in dynamic networks: a parametric mincost flow approach。The twenty-sixth annual ACM-SIAM symposium on discrete algorithms，1343-1356。 | | 2. | Orlin, J. B.(2013)。Max flows in o(nm) time, or better。STOC '13: The forty-fifth annual ACM symposium on Theory of Computing，765-774。 | 圖書| 1. | Ford, L. R.、Fulkerson, D. R.(1962)。Flows in Networks。Princeton, New Jersey：Princeton University Press。 | | 2. | Sheffi, Y.(1985)。Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods。Englewood Cliffs, N.J.：Prentice-Hall。 | | 3. | Ahuja, R. K.、Orlin, J. B.、Magnanti, T. L.(1993)。Network Flows: Theory, Algorithms, and Applications。Prentice-Hall。 | | 4. | Bureau of Public Roads(1964)。Traffic assignment manual。Washington, DC：US Department of Commerce, Urban Planning Division。 | 圖書論文| 1. | Skutella, M.(2009)。An introduction to network flows over time。Research Trends in Combinatorial Optimization。Berlin：Springer。 | |