52 citations · 216 across the 27 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
math.OC2014★ 18 cited
On linear relaxations of OPF problems
Daniel Bienstock, Gonzalo Munoz
We present lifted linear relaxations of the OPF problem.
eess.SY2014
Efficient Synchronization Stability Metrics for Fault Clearing
Scott Backhaus, Russell Bent, Daniel Bienstock +2
Direct methods can provide rapid screening of the dynamical security of large numbers fault and contingency scenarios by avoiding extensive time simulation. We introduce a computat…
math.OC2014★ 3 cited
A note on polynomial solvability of the CDT problem
Daniel Bienstock
We describe a simple polynomial-time algorithm for the CDT problem that relies on a construction of Barvinok.