Optimal flows in dynamic networks and algorithms for their finding
DOI10.1007/978-1-4614-0754-6_13zbMATH Open1248.90027OpenAlexW118936824MaRDI QIDQ2913789FDOQ2913789
Authors: Maria Fonoberova 
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
Recommendations
Programming involving graphs or networks (90C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Stochastic network models in operations research (90B15)
Cited In (39)
- Algorithms for source-to-all maximum cost-to-time ratio problem in acyclic networks
- New algorithms for generalized network flows
- Dynamic flows in networks
- Title not available (Why is that?)
- Minimum cost multicommodity flows in dynamic networks and algorithms for their findings
- Optimal flow and capacity allocation in multiple joint quickest paths of directed networks
- Title not available (Why is that?)
- The maximum flow in dynamic networks
- Title not available (Why is that?)
- The minimum cost multicommodity flow problem in dynamic networks and an algorithm for its solving
- Postoptimizing equilibrium flows on large scale networks
- Title not available (Why is that?)
- A Dynamic Algorithm for Network Propagation
- Some dynamic time-optimality problems on networks with allocation of several resource types
- Determining the optimal flows in zero-time dynamic networks
- Algorithmic approach to time-cost analysis of queued commodity flowing through critical path
- Optimal Flows in Stochastic Dynamic Networks with Congestion
- Time minimizing flows in directed networks
- Flows over time in time-varying networks: optimality conditions and strong duality
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The problem of maximum flow with minimum attainable cost in a network
- Universal maximal flow over time in some network with weight at nodes
- Minimum cost paths over dynamic networks
- Algorithms for construction of optimal and suboptimal solutions in network optimization problems
- Optimal Two-commodity Flows with Non-linear Cost Functions
- Constructing maximal dynamic flows from static flows
- Title not available (Why is that?)
- A survey of dynamic network flows
- Algorithms for finding optimal flows in dynamic networks
- Finding the maximum flow of minimum cost in fuzzy dynamic network with a given vitality degree
- An introduction to dynamic generative networks: minimum cost flow
- Title not available (Why is that?)
- Network flows with age dependent decay rates
- Minimum flow variation in maximum flows
- Two almost easy problems
- Maximum flow problem on dynamic generative network flows with time-varying bounds
Uses Software
This page was built for publication: Optimal flows in dynamic networks and algorithms for their finding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2913789)
