8 citations · 9 across the 3 of their papers we have counts for
1 paper · 2 filters
Daniel Bienstock, Abhinav Verma
We present a rigorous proof of strong NP-hardness of the AC-OPF problem.