Strong NP-hardness of AC power flows feasibility.

Daniel Bienstock Abhinav Verma

Published in: Oper. Res. Lett. (2019)

Keyphrases

np hardness
np hard
approximation algorithms
worst case analysis
discrete tomography
power consumption
mixed integer
lower bound
scheduling problem
optimal solution
evolutionary algorithm
dynamic programming
parameter estimation