10 citations · 11 across the 2 of their papers we have counts for
2 papers
physics.soc-ph2013★ 10 cited
Fast selection of N-2 contingencies for online security assessment
P. A. Kaplunovich, K. S. Turitsyn
We propose a novel algorithm for selection of dangerous N-2 contingencies associated with line or generator failures. The algorithm is based on iterative filtering of the set of al…
physics.soc-ph2012★ 1 cited
Fast Algorithm for N-2 Contingency Problem
K. S. Turitsyn, P. A. Kaplunovich
We present a novel selection algorithm for N-2 contingency analysis problem. The algorithm is based on the iterative bounding of line outage distribution factors and successive pru…