Temporally repeated maximum dynamic flow with intermediate storage

DOI10.1007/S43069-025-00474-5MaRDI QIDQ6933484zbMATH OpenFDO

Authors Durga Prasad Khanal, Urmila Pyakurel, Stephan Dempe

Publication date 4 September 2025

Published in SN Operations Research Forum (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S43069-025-00474-5

zbMATH Keywords

contraflowearliest arrival flowintermediate storagemaximum flowtemporally repeated flow

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Case-oriented studies in operations research (90B90)

Cites work

• <scp>Large‐scale</scp> zone‐based evacuation planning, Part <scp>II</scp>: Macroscopic and microscopic evaluations
• A critical survey on the network optimization algorithms for evacuation planning problems
• A note on two problems in connexion with graphs
• A survey of dynamic network flows
• Abstract network flow with intermediate storage for evacuation planning
• An Algorithm for Universal Maximal Dynamic Flows in a Network
• Approximating earliest arrival flows with flow-dependent transit times
• Complexity analysis for maximum flow problems with arc reversals
• Dynamic contraflow with orientation dependent transit times allowing intermediate storage
• Dynamics of disasters. Algorithmic approaches and applications. Based on the 3rd international conference on dynamics of disasters, Kalamata, Greece, July 2017
• Earliest arrival flows on series-parallel graphs
• Efficient continuous contraflow algorithms for evacuation planning problems
• Efficient continuous-time dynamic network flow algorithms
• scientific article; zbMATH DE number 1714716 (Why is no real title available?)
• scientific article; zbMATH DE number 1003275 (Why is no real title available?)
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 3349645 (Why is no real title available?)
• Large‐scale zone‐based evacuation planning—Part I: Models and algorithms
• Maximal Flow Through a Network
• Maximal, Lexicographic, and Dynamic Network Flows
• Minimum-delay routing in continuous-time dynamic networks with Piecewise-constant capacities
• Models, algorithms, and technologies for network analysis. Proceedings of the second international conference on network analysis, Nizhny Novgorod, Russia, May 7--9, 2012
• Network flow with intermediate storage: models and algorithms
• Network flows. Theory, algorithms, and applications.
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Transient flows in networks
• Universally maximum flow with piecewise-constant capacities

Cited in

(1)

• Optimizing evacuation via budget constrained maximum dynamic flow with speed variation and intermediate storage

This page was built for publication: Temporally repeated maximum dynamic flow with intermediate storage

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6933484)