{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T15:38:49Z","timestamp":1777390729963,"version":"3.51.4"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,1,4]],"date-time":"2024-01-04T00:00:00Z","timestamp":1704326400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,4]],"date-time":"2024-01-04T00:00:00Z","timestamp":1704326400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2024,4]]},"DOI":"10.1007\/s10479-023-05773-w","type":"journal-article","created":{"date-parts":[[2024,1,4]],"date-time":"2024-01-04T14:02:06Z","timestamp":1704376926000},"page":"111-134","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Generalized maximum flow over time with intermediate storage"],"prefix":"10.1007","volume":"335","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3390-9707","authenticated-orcid":false,"given":"Tanka Nath","family":"Dhamala","sequence":"first","affiliation":[]},{"given":"Mohan Chandra","family":"Adhikari","sequence":"additional","affiliation":[]},{"given":"Durga Prasad","family":"Khanal","sequence":"additional","affiliation":[]},{"given":"Urmila","family":"Pyakurel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,1,4]]},"reference":[{"key":"5773_CR1","volume-title":"Network flows: Theory, algorithms, and applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R. K., Orlin, J. B., & Magnanti, T. L. (1993). Network flows: Theory, algorithms, and applications. Prentice-Hall."},{"key":"5773_CR2","unstructured":"Arulselvan, A. (2009). Network model for disaster management. PhD thesis, University of Florida, USA."},{"key":"5773_CR3","doi-asserted-by":"publisher","DOI":"10.7249\/R366","volume-title":"Linear programming and extensions","author":"GB Dantzig","year":"1963","unstructured":"Dantzig, G. B. (1963). Linear programming and extensions. Princeton University Press."},{"issue":"3","key":"5773_CR4","first-page":"101","volume":"15","author":"TN Dhamala","year":"2018","unstructured":"Dhamala, T. N., Pyakurel, U., & Dempe, S. (2018). A critical survey on the network optimization algorithms for evacuation planning problems. International Journal of Operations Research, 15(3), 101\u2013133.","journal-title":"International Journal of Operations Research"},{"key":"5773_CR5","doi-asserted-by":"publisher","unstructured":"Dhamala, T. N., Wagle, S., & Pyakurel, U. (2023). Flowloc problem with maximum excess flow. https:\/\/doi.org\/10.3934\/jimo.2023064","DOI":"10.3934\/jimo.2023064"},{"key":"5773_CR6","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E Dijkstra","year":"1959","unstructured":"Dijkstra, E. (1959). A note on two problems in connection with graph. Numerische Mathematik, 1, 269\u2013271.","journal-title":"Numerische Mathematik"},{"key":"5773_CR7","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0167-6377(98)00037-6","volume":"23","author":"L Fleischer","year":"1998","unstructured":"Fleischer, L., & Tardos, E. (1998). Efficient continuous-time dynamic network flow algorithms. Operations Research Letters, 23, 71\u201380.","journal-title":"Operations Research Letters"},{"key":"5773_CR8","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s101070100238","volume":"91","author":"L Fleischer","year":"2002","unstructured":"Fleischer, L., & Wayne, K. D. (2002). Fast and simple approximation schemes for generalized flow. Mathematical Programming, 91, 215\u2013238.","journal-title":"Mathematical Programming"},{"key":"5773_CR9","doi-asserted-by":"publisher","first-page":"1600","DOI":"10.1137\/S0097539703427215","volume":"36","author":"L Fleischer","year":"2007","unstructured":"Fleischer, L., & Skutella, M. (2007). Quickest flows over time. SIAM Journal of Computing, 36, 1600\u20131630.","journal-title":"SIAM Journal of Computing"},{"key":"5773_CR10","volume-title":"Flows in networks","author":"LR Ford","year":"1962","unstructured":"Ford, L. R., & Fulkerson, D. R. (1962). Flows in networks. Princeton University Press."},{"key":"5773_CR11","volume-title":"Intelligent and Fuzzy techniques for emerging conditions and digital transformation. INFUS 2021. Lecture notes in networks and systems","author":"E Gerasimenko","year":"2022","unstructured":"Gerasimenko, E., Kureichik, V., & Kuliev, E. (2022). Maximum dynamic flow model for hesitant fuzzy evacuation with intermediate storage at nodes. In C. Kahraman, S. Cebi, Onar S. Cevik, B. Oztaysi, A. C. Tolga, & I. U. Sari (Eds.), Intelligent and Fuzzy techniques for emerging conditions and digital transformation. INFUS 2021. Lecture notes in networks and systems.  (Vol. 307). Springer."},{"key":"5773_CR12","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BF01584670","volume":"4","author":"F Glover","year":"1973","unstructured":"Glover, F., & Klingman, D. (1973). On the equivalence of some generalized network flow problems to pure network problems. Mathematical Programming, 4, 267\u2013278.","journal-title":"Mathematical Programming"},{"issue":"2","key":"5773_CR13","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1287\/moor.16.2.351","volume":"16","author":"AV Goldberg","year":"1991","unstructured":"Goldberg, A. V., Plotkin, S. A., & Tardos, \u00c9. (1991). Combinatorial algorithms for the generalized circulation problem. Mathematics of operations research, 16(2), 351\u2013381.","journal-title":"Mathematics of operations research"},{"key":"5773_CR14","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1287\/moor.21.3.529","volume":"21","author":"D Goldfarb","year":"1996","unstructured":"Goldfarb, D., & Jin, Z. (1996). A faster combinatorial algorithm for the generalized circulation problem. Mathematics of Operations Research, 21, 529\u2013539.","journal-title":"Mathematics of Operations Research"},{"key":"5773_CR15","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1287\/moor.22.4.793","volume":"22","author":"D Goldfarb","year":"1997","unstructured":"Goldfarb, D., Jin, Z., & Orlil, J. B. (1997). Polynomial time highest gain augmenting path algorithms for the generalized circulation problem. Mathematics of Operations Research, 22, 793\u2013802.","journal-title":"Mathematics of Operations Research"},{"key":"5773_CR16","volume-title":"Graphs and algorithms","author":"M Gondran","year":"1984","unstructured":"Gondran, M., & Minoux, M. (1984). Graphs and algorithms. Wiley."},{"key":"5773_CR17","unstructured":"Gro\u00df, M. (2014). Approximation algorithms for complex network flow over time problems. PhD Thesis, Technical University, Berlin."},{"key":"5773_CR18","doi-asserted-by":"crossref","unstructured":"Gro\u00df, M., & Skutella, M. (2012). Generalized maximum flows over time. In International workshop on approximation and online algorithms (pp. 247\u2013260).","DOI":"10.1007\/978-3-642-29116-6_21"},{"issue":"1","key":"5773_CR19","first-page":"12","volume":"11","author":"SP Gupta","year":"2022","unstructured":"Gupta, S. P., Pyakurel, U., & Dhamala, T. N. (2022). Generalized dynamic contraflow with non-symmetric transit times. American Journal of Computational and Applied Mathematics, 11(1), 12\u201317.","journal-title":"American Journal of Computational and Applied Mathematics"},{"key":"5773_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-023-05210-y","author":"SP Gupta","year":"2023","unstructured":"Gupta, S. P., Pyakurel, U., & Dhamala, T. N. (2023). Multicommodity-flow problem on lossy network with partial lane reversals. Annals of Operation Research. https:\/\/doi.org\/10.1007\/s10479-023-05210-y","journal-title":"Annals of Operation Research"},{"key":"5773_CR21","first-page":"36","volume":"25","author":"H Hoppe","year":"1998","unstructured":"Hoppe, H., & Tardos, \u00c9. (1998). The quickest transshipment problem. Mathematics, 25, 36\u201362.","journal-title":"Mathematics"},{"issue":"4","key":"5773_CR22","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1287\/opre.10.4.476","volume":"10","author":"WS Jewell","year":"1962","unstructured":"Jewell, W. S. (1962). New methods in mathematical programming\u2014Optimal flow through networks with gains. Operations Research, 10(4), 476\u2013499.","journal-title":"Operations Research"},{"key":"5773_CR23","doi-asserted-by":"publisher","DOI":"10.1155\/2021\/5063207","author":"DP Khanal","year":"2021","unstructured":"Khanal, D. P., Pyakurel, U., & Dhamala, T. N. (2021). Maximum multicommodity flow with intermediate storage. Mathematical Problems in Engineering. https:\/\/doi.org\/10.1155\/2021\/5063207","journal-title":"Mathematical Problems in Engineering"},{"key":"5773_CR24","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1287\/opre.21.2.517","volume":"21","author":"E Minieka","year":"1973","unstructured":"Minieka, E. (1973). Maximal, lexicographic, and dynamic network flows. Operations Research, 21, 517\u2013527.","journal-title":"Operations Research"},{"key":"5773_CR25","doi-asserted-by":"publisher","DOI":"10.1155\/2021\/6613622","author":"HN Nath","year":"2021","unstructured":"Nath, H. N., Pyakurel, U., & Dhamala, T. N. (2021). Network reconfiguration with orientation dependent travel times. International Journal of Mathematics and Mathematical Sciences. https:\/\/doi.org\/10.1155\/2021\/6613622","journal-title":"International Journal of Mathematics and Mathematical Sciences"},{"key":"5773_CR26","first-page":"2943","volume":"17","author":"HN Nath","year":"2021","unstructured":"Nath, H. N., Pyakurel, U., Dhamala, T. N., & Dempe, S. (2021). Dynamic network flow location models and algorithms for quickest evacuation planning. Journal of Management and Optimization, 17, 2943\u20132970.","journal-title":"Journal of Management and Optimization"},{"key":"5773_CR27","doi-asserted-by":"publisher","unstructured":"Olver, N., & V\u00e9gh, L.A. (2017). A simpler and faster strongly polynomial algorithm for generalized flow maximization problem. In Proceeding of the 49th Annual ACM SIGACT Symposium on Theory of Computing (pp. 1100\u2013111). https:\/\/doi.org\/10.1145\/3055399.3055439","DOI":"10.1145\/3055399.3055439"},{"issue":"3","key":"5773_CR28","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1109\/TCT.1966.1082612","volume":"13","author":"K Onaga","year":"1966","unstructured":"Onaga, K. (1966). Dynamic programming of optimum flows in lossy communication nets. IEEE Transactions on Circuit Theory, 13(3), 282\u2013287.","journal-title":"IEEE Transactions on Circuit Theory"},{"issue":"4","key":"5773_CR29","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0016-0032(67)90046-4","volume":"283","author":"K Onaga","year":"1967","unstructured":"Onaga, K. (1967). Optimum flows in general communication networks. Journal of the Franklin Institute, 283(4), 308\u2013327.","journal-title":"Journal of the Franklin Institute"},{"issue":"4","key":"5773_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s43069-020-00033-0","volume":"1","author":"U Pyakurel","year":"2020","unstructured":"Pyakurel, U., & Dempe, S. (2020). Network flow with intermediate storage: Models and algorithms. SN Operations Research Forum, 1(4), 1\u201323.","journal-title":"SN Operations Research Forum"},{"key":"5773_CR31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64973-9_14","volume-title":"Dynamics of disasters. Springer optimization and its applications","author":"U Pyakurel","year":"2021","unstructured":"Pyakurel, U., & Dempe, S. (2021). Universal maximum flow with intermediate storage for evacuation planning. In I. S. Kotsireas, A. Nagurney, P. M. Pardalos, & A. Tsokas (Eds.), Dynamics of disasters. Springer optimization and its applications.  (Vol. 169). Springer. https:\/\/doi.org\/10.1007\/978-3-030-64973-9_14"},{"key":"5773_CR32","doi-asserted-by":"publisher","DOI":"10.1155\/2016\/7902460","author":"U Pyakurel","year":"2016","unstructured":"Pyakurel, U., & Dhamala, T. N. (2016). Continuous time dynamic contraflow models and algorithms. Advances of Operations Research. https:\/\/doi.org\/10.1155\/2016\/7902460","journal-title":"Advances of Operations Research"},{"issue":"1","key":"5773_CR33","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/s10479-016-2302-5","volume":"253","author":"U Pyakurel","year":"2017","unstructured":"Pyakurel, U., & Dhamala, T. N. (2017). Continuous dynamic contraflow approach for evacuation planning. Annals of Operations Research, 253(1), 573\u2013598.","journal-title":"Annals of Operations Research"},{"issue":"1 & 2","key":"5773_CR34","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s10479-017-2427-1","volume":"254","author":"U Pyakurel","year":"2017","unstructured":"Pyakurel, U., Dhamala, T. N., & Dempe, S. (2017). Efficient continuous contraflow algorithms for evacuation planning problems. Annals of Operations Research, 254(1 & 2), 335\u2013364.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"5773_CR35","first-page":"27","volume":"3","author":"U Pyakurel","year":"2014","unstructured":"Pyakurel, U., Hamacher, H. W., & Dhamala, T. N. (2014). Generalized maximum dynamic contraflow on lossy network. International Journal of Operations Research Nepal, 3(1), 27\u201344.","journal-title":"International Journal of Operations Research Nepal"},{"key":"5773_CR36","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2022.06.054","author":"U Pyakurel","year":"2022","unstructured":"Pyakurel, U., Khanal, D. P., & Dhamala, T. N. (2022). Abstract network flow with intermediate storage for evacuation planning. European Journal of Operational Research. https:\/\/doi.org\/10.1016\/j.ejor.2022.06.054","journal-title":"European Journal of Operational Research"},{"key":"5773_CR37","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/s10479-018-3031-8","volume":"283","author":"U Pyakurel","year":"2019","unstructured":"Pyakurel, U., Nath, H. N., & Dhamala, T. N. (2019). Partial contraflow with path reversals for evacuation planning. Annals of Operations Research, 283, 591\u2013612.","journal-title":"Annals of Operations Research"},{"key":"5773_CR38","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1287\/moor.23.1.69","volume":"23","author":"T Radzik","year":"1998","unstructured":"Radzik, T. (1998). Faster algorithms for the generalized network flow problem. Mathematics of Operations Research, 23, 69\u2013100.","journal-title":"Mathematics of Operations Research"},{"issue":"2","key":"5773_CR39","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/s10878-008-9175-8","volume":"19","author":"S Rebennack","year":"2010","unstructured":"Rebennack, S., Arulselvan, A., Elefteriadou, L., & Pardalos, P. M. (2010). Complexity analysis for maximum flow problems with arc reversals. Journal of Combinatorial Optimization, 19(2), 200\u2013216.","journal-title":"Journal of Combinatorial Optimization"},{"issue":"4","key":"5773_CR40","doi-asserted-by":"publisher","first-page":"244","DOI":"10.15807\/jorsj.47.244","volume":"47","author":"M Shigeno","year":"2004","unstructured":"Shigeno, M. (2004). A survey of combinatorial maximum flow algorithms on a network with gains. Journal of the Operations Research, Society of Japan, 47(4), 244\u2013264.","journal-title":"Journal of the Operations Research, Society of Japan"},{"key":"5773_CR41","doi-asserted-by":"crossref","unstructured":"Tardos, \u00c9., & Wayne, K. D. (1998). Simple generalized maximum flow algorithms. In 6th international integer programming and combinatorial optimization conferences (pp. 310\u2013324).","DOI":"10.1007\/3-540-69346-7_24"},{"issue":"2","key":"5773_CR42","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1137\/0132037","volume":"32","author":"K Truemper","year":"1977","unstructured":"Truemper, K. (1977). On max flows with gains and pure min-cost flows. SIAM Journal on Applied Mathematics, 32(2), 450\u2013456.","journal-title":"SIAM Journal on Applied Mathematics"},{"issue":"1","key":"5773_CR43","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1287\/moor.2016.0800","volume":"42","author":"LA V\u00e9gh","year":"2016","unstructured":"V\u00e9gh, L. A. (2016). A strongly polynomial algorithm for generalized flow maximization problem. Mathematics of Operations Research, 42(1), 179\u2013211. https:\/\/doi.org\/10.1287\/moor.2016.0800","journal-title":"Mathematics of Operations Research"},{"key":"5773_CR44","unstructured":"Wayne, K. D. (1999). Generalized maximum flow algorithms. PhD Thesis, Cornell University."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-023-05773-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-023-05773-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-023-05773-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,29]],"date-time":"2024-03-29T16:24:28Z","timestamp":1711729468000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-023-05773-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,4]]},"references-count":44,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["5773"],"URL":"https:\/\/doi.org\/10.1007\/s10479-023-05773-w","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1,4]]},"assertion":[{"value":"11 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 November 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 January 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that there is no conflict of interest regarding the publication of this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}