8 citations · 9 across the 3 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
math.OC2015
Strong NP-hardness of AC power flows feasibility
Daniel Bienstock, Abhinav Verma
We present a rigorous proof of strong NP-hardness of the AC-OPF problem.
math.OC2009★ 1 cited
The N-K Problem in Power Grids: New Models, Formulations and Numerical Experiments (extended version)
Daniel Bienstock, Abhinav Verma
Given a power grid modeled by a network together with equations describing the power flows, power generation and consumption, and the laws of physics, the so-called N-k problem ask…