Optimal Flows in Dynamic Networks and Algorithms for their Finding
From MaRDI portal
Publication:2913789
DOI10.1007/978-1-4614-0754-6_13zbMath1248.90027OpenAlexW118936824MaRDI QIDQ2913789
Publication date: 27 September 2012
Published in: Handbook of Optimization in Complex Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-0754-6_13
Programming involving graphs or networks (90C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Stochastic network models in operations research (90B15)
Related Items (3)
An introduction to dynamic generative networks: minimum cost flow ⋮ Maximum flow problem on dynamic generative network flows with time-varying bounds ⋮ Unnamed Item
Uses Software
This page was built for publication: Optimal Flows in Dynamic Networks and Algorithms for their Finding