Minimum flow problem on network flows with time-varying bounds

DOI10.1016/J.APM.2011.11.067MaRDI QIDQ693577zbMATH OpenOpenAlexFDO

Authors Hassan Salehi Fathabadi, Salman Khodayifar, M. A. 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)

Recommendations

• A polynomial time algorithm for the minimum flow problem in time-varying networks
• Minimum cost time-varying network flow problems
• Time-varying minimum cost flow problems
• scientific article; zbMATH DE number 1918689
• Maximum flow problem on dynamic generative network flows with time-varying bounds

Cites work

• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 2038726 (Why is no real title available?)
• scientific article; zbMATH DE number 3349645 (Why is no real title available?)
• scientific article; zbMATH DE number 956788 (Why is no real title available?)
• A survey of dynamic network flows
• An introduction to network flows over time
• Constructing maximal dynamic flows from static flows
• Maximum flow problem on dynamic generative network flows with time-varying bounds
• Minimum-cost dynamic flows: The series-parallel case
• Network flows. Theory, algorithms, and applications.
• Sequential and parallel algorithms for minimum flows.

Cited in

(9)

• Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle
• Minimal-cost network flow problems with variable lower bounds on arc flows
• scientific article; zbMATH DE number 5990494 (Why is no real title available?)
• Fractional multi-commodity flow problem: duality and optimality conditions
• A robust optimization approach for multicast network coding under uncertain link costs
• Solving the minimum flow problem with interval bounds and flows
• On solving maximum and quickest interval-valued flows over time
• A polynomial time algorithm for the minimum flow problem in time-varying networks
• Minimum cost flow time-windows problem with interval bounds and flows

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

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