Network restructuring for dynamic flow improvement

DOI10.1007/S10479-025-06496-WMaRDI QIDQ6983101zbMATH OpenFDO

Authors Tanka Nath Dhamala, Durga Prasad Khanal, Stephan Dempe

Publication date 15 May 2025

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10479-025-06496-W

zbMATH Keywords

network optimizationevacuation planningquickest flowcontraflowflow maximization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Transportation, logistics and supply chain management (90B06)

Cites work

• scientific article; zbMATH DE number 1714716 (Why is no real title available?)
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 1947425 (Why is no real title available?)
• scientific article; zbMATH DE number 956788 (Why is no real title available?)
• A comprehensive survey on the quickest path problem
• 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 Temporally Repeated Flow with Intermediate Storage
• Abstract network flow with intermediate storage for evacuation planning
• An Algorithm for Universal Maximal Dynamic Flows in a Network
• An FPTAS for quickest multicommodity flows with inflow-dependent transit times
• Approximating earliest arrival flows with flow-dependent transit times
• Complexity analysis for maximum flow problems with arc reversals
• Continuous dynamic contraflow approach for evacuation planning
• Dynamic network flow location models and algorithms for quickest evacuation planning
• Earliest Arrival Flows with Multiple Sources
• Earliest arrival flows on series-parallel graphs
• Efficient algorithms for abstract flow with partial switching
• Efficient continuous contraflow algorithms for evacuation planning problems
• Efficient contraflow algorithms for quickest evacuation planning
• Finding Minimum-Cost Circulations by Successive Approximation
• FlowLoc problems with maximum excess flow
• Flows over Time with Load-Dependent Transit Times
• Generalized Maximum Flows over Time
• Maximal, Lexicographic, and Dynamic Network Flows
• Multi-commodity flow problem on lossy network with partial lane reversals
• Multicommodity flows over time: Efficient algorithms and complexity
• Network flow with intermediate storage: models and algorithms
• OR/MS research in disaster operations management
• On the quickest flow problem in dynamic networks -- a parametric min-cost flow approach
• Optimal flows in networks with multiple sources and sinks
• Optimum flows in general communication networks
• Partial contraflow with path reversals for evacuation planning
• Quickest Flows Over Time
• Relief distribution networks: a systematic review
• Saving a path minimizing egress time of a dynamic contraflow: a bi-objective programming approach
• The quickest flow problem
• The quickest transshipment problem
• Transient flows in networks
• \(M / G / c / c\) state dependent travel time models and properties

Cited in

(1)

• On the quickest evacuation location problem in humanitarian operations: multi-objective modelling and matheuristic solution

This page was built for publication: Network restructuring for dynamic flow improvement

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