activity
20092026
most citedImitation-Projected Programmatic Reinforcement Learning

8 citations · 9 across the 3 of their papers we have counts for

collaborators
Showing 2015Show all

1 paper · 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.