A polynomial time algorithm for the minimum flow problem in time-varying networks

DOI10.1007/s10479-017-2450-2zbMath1411.90067OpenAlexW2593184009MaRDI QIDQ1730612

Mohammad Ali Raayatpanah, Salman Khodayifar, Panos M. Pardalos

Publication date: 6 March 2019

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

Full work available at URL: https://doi.org/10.1007/s10479-017-2450-2

zbMATH Keywords

combinatorial optimizationnetwork flows(dynamic) minimum flow(dynamic) preflow-pull algorithm

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items (1)

Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Continuous and discrete flows over time
• Minimum flow problem on network flows with time-varying bounds
• A survey of dynamic network flows
• Efficient continuous-time dynamic network flow algorithms
• Sequential and parallel algorithms for minimum flows.
• Flows over time in time-varying networks: optimality conditions and strong duality
• A note on the parametric maximum flow problem and some related reoptimization issues
• Multicriteria adaptive paths in stochastic, time-varying networks
• An Introduction to Network Flows over Time
• Minimum-cost dynamic flows: The series-parallel case
• A Fast Parametric Maximum Flow Algorithm and Applications
• Constructing Maximal Dynamic Flows from Static Flows
• Quickest Flows Over Time
• Max flows in O(nm) time, or better
• Time-varying minimum cost flow problems

This page was built for publication: A polynomial time algorithm for the minimum flow problem in time-varying networks