Minimum flow problem on network flows with time-varying bounds
From MaRDI portal
Publication:693577
DOI10.1016/J.APM.2011.11.067zbMATH Open1252.90013OpenAlexW2059788728MaRDI QIDQ693577FDOQ693577
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
Recommendations
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Cites Work
- Network flows. Theory, algorithms, and applications.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Constructing Maximal Dynamic Flows from Static Flows
- An Introduction to Network Flows over Time
- Minimum-cost dynamic flows: The series-parallel case
- A survey of dynamic network flows
- Title not available (Why is that?)
- Maximum flow problem on dynamic generative network flows with time-varying bounds
- Sequential and parallel algorithms for minimum flows.
- Title not available (Why is that?)
Cited In (7)
- 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
- A polynomial time algorithm for the minimum flow problem in time-varying networks
- Fractional multi-commodity flow problem: duality and optimality conditions
- On solving maximum and quickest interval-valued flows over time
- Title not available (Why is that?)
- A robust optimization approach for multicast network coding under uncertain link costs
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)
