Journal
OPERATIONS RESEARCH LETTERS
Volume 47, Issue 6, Pages 494-501Publisher
ELSEVIER
DOI: 10.1016/j.orl.2019.08.009
Keywords
NP-completeness; Power flows; Approximation algorithms
Categories
Funding
- ONR [HDTRAI-13-1-0021]
- DARPA, USA RADICS award [N00014-16-1-2889]
- DARPA, USA Lagrange award
Ask authors/readers for more resources
We prove that testing feasibility for an AC power flow system is a strongly NP-hard problem. (C) 2019 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
