Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
SIAM Journal on Optimization
Blackout Mitigation Assessment in Power Transmission Systems
HICSS '03 Proceedings of the 36th Annual Hawaii International Conference on System Sciences (HICSS'03) - Track 2 - Volume 2
Mathematical Programming: Series A and B
Reformulation and sampling to solve a stochastic network interdiction problem
Networks - Games, Interdiction, and Human Interaction Problems on Networks
Optimization Strategies for the Vulnerability Analysis of the Electric Power Grid
SIAM Journal on Optimization
Power grid security analysis: an optimization approach
Power grid security analysis: an optimization approach
Using mixed-integer programming to solve power grid blackout problems
Discrete Optimization
Designing AC power grids using integer linear programming
INOC'11 Proceedings of the 5th international conference on Network optimization
Sensitivity analysis of the power grid vulnerability to large-scale cascading failures
ACM SIGMETRICS Performance Evaluation Review
Computational analysis of cascading failures in power networks
Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
| Hi-index | 0.00 |
Given a power grid modeled by a network together with equations describing power flows, power generation and consumption, the so-called $N-k$ problem asks whether there exists a set of $k$ or fewer arcs whose removal will cause the system to fail. The case where $k$ is small is of practical interest. We present theoretical and numerical results involving a mixed-integer linear model and a continuous nonlinear model related to this problem.