Using mixed-integer programming to solve power grid blackout problems
From MaRDI portal
Publication:2471280
DOI10.1016/j.disopt.2006.10.007zbMath1173.90335MaRDI QIDQ2471280
Bienstock, Daniel, Sara Mattia
Publication date: 22 February 2008
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2006.10.007
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partitioning procedures for solving mixed-variables programming problems
- Minimum cost capacity installation for multicommodity network flows
- Mathematical study of very high voltage power networks. III: The optimal AC power flow problem
- Mathematical Study of Very High Voltage Power Networks II: The AC Power Flow Problem
- Mathematical Study of Very High Voltage Power Networks I: The Optimal DC Power Flow Problem
- A LOADING-DEPENDENT MODEL OF PROBABILISTIC CASCADING FAILURE
- Network Design Using Cut Inequalities
- Über ein Paradoxon aus der Verkehrsplanung
- Integer Programming and Combinatorial Optimization