Minimum flow problem on network flows with time-varying bounds
- 26 November 2011
- journal article
- Published by Elsevier BV in Applied Mathematical Modelling
- Vol. 36 (9), 4414-4421
- https://doi.org/10.1016/j.apm.2011.11.067
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Maximum flow problem on dynamic generative network flows with time-varying boundsApplied Mathematical Modelling, 2010
- An Introduction to Network Flows over TimePublished by Springer Science and Business Media LLC ,2008
- Minimum‐cost dynamic flows: The series‐parallel caseNetworks, 2004
- Sequential and parallel algorithms for minimum flowsJournal of Applied Mathematics and Computing, 2004
- A survey of dynamic network flowsAnnals of Operations Research, 1989
- Constructing Maximal Dynamic Flows from Static FlowsOperations Research, 1958