Algorithms for Finding Optimal Flows in Dynamic Networks
From MaRDI portal
Publication:2974407
DOI10.1007/978-3-642-12686-4_2zbMath1359.90014OpenAlexW175866009MaRDI QIDQ2974407
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
Related Items (5)
Structure and stability of the equilibrium set in potential-driven flow networks ⋮ Facets of the Stochastic Network Flow Problem ⋮ On solving continuous-time dynamic network flows ⋮ Large-scale unit commitment under uncertainty: an updated literature survey ⋮ Large-scale unit commitment under uncertainty
Uses Software
Cites Work
- A survey of dynamic network flows
- Global search algorithms for minimum concave-cost network flow problems
- An implementation of linear and nonlinear multicommodity network flows
- One, two, three, many, or: Complexity aspects of dynamic network flows with dedicated arcs
- Solving difficult multicommodity problems with a specialized interior-point algorithm
- Uncertainty in the electric power industry. Methods and models for decision support
- Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
- Faster Algorithms for the Quickest Transshipment Problem
- The Quickest Transshipment Problem
- Universally maximum flow with piecewise-constant capacities
- Multicommodity network flows—A survey
- Progress Made in Solving the Multicommodity Flow Problem
- A Specialized Interior-Point Algorithm for Multicommodity Network Flows
- A Dynamic Network Flow Problem with Uncertain arc Capacities: Formulation and Problem Structure
- Time-varying minimum cost flow problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Algorithms for Finding Optimal Flows in Dynamic Networks
