Minimum flow problem on network flows with time-varying bounds

DOI10.1016/j.apm.2011.11.067zbMath1252.90013OpenAlexW2059788728MaRDI QIDQ693577

Hassan Salehi Fathabadi, Salman Khodayifar, Mohammad Ali Raayatpanah

Publication date: 7 December 2012

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2011.11.067

zbMATH Keywords

dynamic network flowminimum flow problemreoptimization technique

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items (4)

Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle ⋮ Fractional multi-commodity flow problem: duality and optimality conditions ⋮ A polynomial time algorithm for the minimum flow problem in time-varying networks ⋮ A robust optimization approach for multicast network coding under uncertain link costs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of dynamic network flows
• Maximum flow problem on dynamic generative network flows with time-varying bounds
• Sequential and parallel algorithms for minimum flows.
• An Introduction to Network Flows over Time
• Minimum-cost dynamic flows: The series-parallel case
• Constructing Maximal Dynamic Flows from Static Flows

This page was built for publication: Minimum flow problem on network flows with time-varying bounds