[1] | P. P. Bhandari, and S. R. Khadka (2020). Evacuation contraflow problems with not necessarily equal transit time on anti-parallel arcs, American Journal of Applied Mathematics, 8(4), 230-235. |
[2] | T. N. Dhamala, S. P. Gupta, D. P. Khanal, and U. Pyakurel (2020). Quickest multi-commodity flow over time with partial lane reversals, Journal of Mathematics and Statistics, 16(1), 198-211. |
[3] | T. N. Dhamala, U. Pyakurel, and S. Dempe (2018). A critical survey on the network optimization algorithms for evacuation planning problems, International Journal of Operations Research, 15(3), 101-133. |
[4] | R. C. Dhungana, and T. N., Dhamala (2020). Flow improvement in evacuation planning with budget constrained switching costs, International Journal of Mathematics and Mathematical Sciences, Hindawi, 2020, Article ID 1605806, 10 pages, doi.org/10.1155/2020/1605806. |
[5] | L. Fleischer, and E. Tardos (1998). Efficient continuous-time dynamic network flow algorithms, Operations Research Letters, 23, 71-80. |
[6] | L. R. Ford, and D. R. Fulkerson (1958). Constructing maximal dynamic flows from static flows, Operations Research, 6, 419-433. |
[7] | L. R. Ford, and D. R., Fulkerson (1962). Flows in Networks, Princeton University Press, Princeton, New jersey. |
[8] | A. V. Goldberg, S. A. Plotkin, and E. Tardos (1991). Combinatorial algorithms for the generalized circulation problem, Mathematics of operations research, 16(2), 351-381. |
[9] | M. Gondran, and M. Minoux (1984). Graphs and algorithms, Wiley, New York. |
[10] | M. Gross (2014). Approximation algorithms for complex network flow over time problems, Ph.D. Thesis, Technical University, Berlin. |
[11] | M. Gross, and M. Skutella (2012). Generalized maximum flows over time, International Workshop on Approximation and Online Algorithms, 247-260. |
[12] | S. P. Gupta, D. P. Khanal, U. Pyakurel, and T. N. Dhamala (2020). Approximate algorithms for continuous-time quickest multi-commodity contraflow problem, The Nepali Mathematical Sciences Report, 37(1-2), 30-46. |
[13] | W. S. Jewell (1962). New methods in mathematical programming optimal flow through networks with gains, Operations Research, 10(4), 476-499. |
[14] | H.N. Nath, U. Pyakurel, T.N. Dhamala (2021). Network reconfiguration with orientation dependent transit times, International Journal of Mathematics and Mathematical Sciences, Hindawi, Volume 2021, Article ID 6613622, 11 pages https://doi.org/10.1155/2021/6613622. |
[15] | H. N. Nath, U. Pyakurel, T. N. Dhamala, and S. Dempe (2020). Dynamic network flow location models and algorithms for evacuation planning, Journal of Industrial and Management Optimization, 13 (5), 1-28, doi:10.3934/jimo.2020102. |
[16] | K. Onaga (1966). Dynamic programming of optimum flows in lossy communication nets, Journal of the Franklin Institute, 13(3), 282-287. |
[17] | K. Onaga (1967). Optimum flows in general communication networks, IEEE Transactions on Circuit Theory, 283(4), 308-327. |
[18] | U. Pyakurel (2018). Generalized contraflow for evacuation planning problem Journal of Nepal Mathematical Society, 1, 38-49. |
[19] | U. Pyakurel, H. W. Hamacher, and T. N. Dhamala (2014). Generalized maximum dynamic contraflow on lossy network, International Journal of Operations Research Nepal, 3(1), 27-44. |
[20] | U. Pyakurel, H. N. Nath, S. Dempe, and T. N. Dhamala (2019). Efficient dynamic flow algorithms for evacuation planning problems with partial lane reversal, Mathematics, 7, 1-29. |
[21] | U. Pyakurel, and T. N. Dhamala (2016). Continuous time dynamic contraflow models and algorithms, Advances in Operations Research, Hindawi, Volume 2016, Article ID 368587, 7 pages. |
[22] | U. Pyakurel, and T. N. Dhamala (2017). Evacuation planning by earliest arrival contraflow, Journal of Industrial and Management Optimization, 13 (1), 487-501. |
[23] | U. Pyakurel, and T. N., Dhamala (2017). Continuous dynamic contraflow approach for evacuation planning, Annals of Operations Research, 253, 573-598. |
[24] | U. Pyakurel, T. N. Dhamala, and S. Dempe (2017). Efficient continuous contraflow algorithms for evacuation planning problems, Annals of Operations Research, 254, 335-364. |
[25] | U. Pyakurel, S. P. Gupta, D. P. Khanal, and T. N. Dhamala (2020). Efficient algorithms on multi-commodity flow over time problems with partial lane reversals, International Journal of Mathematics and Mathematical Sciences, Hindawi, Volume 2020, Article ID 2676378, 13 pages https://doi.org/10.1155/2020/2676378. |
[26] | U. Pyakurel, H. N. Nath, and T. N. Dhamala (2018). Efficient contraflow algorithms for quickest evacuation planning, Science China Mathematics, 61, 2079-2100. |
[27] | S. Rebennack, A. Arulselvan, L. Elefteriadou, and P. M. Pardalos (2010). Complexity analysis for maxi- mum flow problems with arc reversals, Journal of Combinatorial Optimization, 19, 200-216. |
[28] | K. Truemper (1977). On max flows with gains and pure min-cost flows, SIAM Journal on Applied Mathematics, 32(2), 450-456. |