Algorithms for finding optimal flows in dynamic networks

DOI10.1007/978-3-642-12686-4_2MaRDI QIDQ2974407zbMATH OpenOpenAlexFDO

Authors Maria Fonoberova

Publication date 7 April 2017

Published in Handbook of Power Systems II (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-12686-4_2

zbMATH Keywords

dynamic networksminimum cost flow problemmulticommodity flowsnetwork flowsoptimal flows

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Recommendations

• Optimal flows in dynamic networks and algorithms for their finding
• scientific article; zbMATH DE number 1984104
• Dynamic flows in networks
• scientific article; zbMATH DE number 1918689
• scientific article; zbMATH DE number 2187103

Cites work

• A Dynamic Network Flow Problem with Uncertain arc Capacities: Formulation and Problem Structure
• A Specialized Interior-Point Algorithm for Multicommodity Network Flows
• A survey of dynamic network flows
• An implementation of linear and nonlinear multicommodity network flows
• Approximating fractional multicommodity flow independent of the number of commodities
• Faster algorithms for the quickest transshipment problem
• Global search algorithms for minimum concave-cost network flow problems
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 5129471 (Why is no real title available?)
• scientific article; zbMATH DE number 1086914 (Why is no real title available?)
• scientific article; zbMATH DE number 1918689 (Why is no real title available?)
• scientific article; zbMATH DE number 1560336 (Why is no real title available?)
• scientific article; zbMATH DE number 956788 (Why is no real title available?)
• Minimum cost multicommodity flows in dynamic networks and algorithms for their findings
• Multicommodity network flows—A survey
• One, two, three, many, or: Complexity aspects of dynamic network flows with dedicated arcs
• Progress Made in Solving the Multicommodity Flow Problem
• Solving difficult multicommodity problems with a specialized interior-point algorithm
• The quickest transshipment problem
• Time-varying minimum cost flow problems
• Uncertainty in the electric power industry. Methods and models for decision support
• Universally maximum flow with piecewise-constant capacities

Cited in

(16)

• New algorithms for generalized network flows
• Large-scale unit commitment under uncertainty: an updated literature survey
• Determining the optimal flows in zero-time dynamic networks
• Large-scale unit commitment under uncertainty
• Algorithms for placing monitors in a flow network
• Structure and stability of the equilibrium set in potential-driven flow networks
• Optimal flows in dynamic networks and algorithms for their finding
• Improving the efficiency of the dynamic analysis of mass flow networks
• scientific article; zbMATH DE number 5129471 (Why is no real title available?)
• Lökal optimale lösungen der kombinierten strom- und spannungsoptimlerung auf netzwerken im anwendungsfall der abaufplanung
• A comparison of phase and nonphase network flow algorithms
• On solving continuous-time dynamic network flows
• scientific article; zbMATH DE number 1783111 (Why is no real title available?)
• A Dynamic Algorithm for Network Propagation
• Facets of the stochastic network flow problem
• Optimized Design of Dynamic Networks with Heuristic Algorithms

Describes a project that uses

Uses Software

• PPRN
• IPM

This page was built for publication: Algorithms for finding optimal flows in dynamic networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2974407)