Optimal flows in dynamic networks and algorithms for their finding

DOI10.1007/978-1-4614-0754-6_13MaRDI QIDQ2913789zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Stochastic network models in operations research (90B15) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 1984104
• Algorithms for finding optimal flows in dynamic networks
• Minimum cost multicommodity flows in dynamic networks and algorithms for their findings
• scientific article; zbMATH DE number 5129471
• scientific article; zbMATH DE number 1918689

Cited in

(43)

• Network flows with age dependent decay rates
• Dynamic flows in networks
• Postoptimizing equilibrium flows on large scale networks
• New algorithms for generalized network flows
• Some dynamic time-optimality problems on networks with allocation of several resource types
• Determining the optimal flows in zero-time dynamic networks
• Optimal flow and capacity allocation in multiple joint quickest paths of directed networks
• Algorithmic approach to time-cost analysis of queued commodity flowing through critical path
• Flows over time in time-varying networks: optimality conditions and strong duality
• The minimum cost multicommodity flow problem in dynamic networks and an algorithm for its solving
• Algorithms for finding optimal flows in dynamic networks
• scientific article; zbMATH DE number 2187103 (Why is no real title available?)
• Minimum flow variation in maximum flows
• Minimum cost paths over dynamic networks
• Time minimizing flows in directed networks
• Algorithms for construction of optimal and suboptimal solutions in network optimization problems
• Universal maximal flow over time in some network with weight at nodes
• scientific article; zbMATH DE number 5129471 (Why is no real title available?)
• Two almost easy problems
• scientific article; zbMATH DE number 3961334 (Why is no real title available?)
• scientific article; zbMATH DE number 3972590 (Why is no real title available?)
• scientific article; zbMATH DE number 3982887 (Why is no real title available?)
• scientific article; zbMATH DE number 44551 (Why is no real title available?)
• scientific article; zbMATH DE number 1741775 (Why is no real title available?)
• scientific article; zbMATH DE number 1157097 (Why is no real title available?)
• Algorithms for source-to-all maximum cost-to-time ratio problem in acyclic networks
• scientific article; zbMATH DE number 1984104 (Why is no real title available?)
• scientific article; zbMATH DE number 1918689 (Why is no real title available?)
• A Generalization of Dynamic Programming for Pareto Optimization in Dynamic Networks
• scientific article; zbMATH DE number 1783111 (Why is no real title available?)
• scientific article; zbMATH DE number 6913891 (Why is no real title available?)
• Optimal Two-commodity Flows with Non-linear Cost Functions
• scientific article; zbMATH DE number 934458 (Why is no real title available?)
• The problem of maximum flow with minimum attainable cost in a network
• A Dynamic Algorithm for Network Propagation
• Finding the maximum flow of minimum cost in fuzzy dynamic network with a given vitality degree
• Optimal Flows in Stochastic Dynamic Networks with Congestion
• Constructing maximal dynamic flows from static flows
• Minimum cost multicommodity flows in dynamic networks and algorithms for their findings
• The maximum flow in dynamic networks
• An introduction to dynamic generative networks: minimum cost flow
• A survey of dynamic network flows
• Maximum flow problem on dynamic generative network flows with time-varying bounds

Describes a project that uses

Uses Software

• PPRN

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)