Pith. sign in

REVIEW

AC-Feasibility on Tree Networks is NP-Hard

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1410.8253 v1 pith:ZWHH4B6H submitted 2014-10-30 cs.CC math.OC

Karsten Lehmann , Alban Grastien , Pascal Van Hentenryck This is my paper · ORCID
classification cs.CCmath.OC
keywords networkstreeac-feasibilitynp-hardconditionsconeconvexdemand
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Recent years have witnessed significant interest in convex relaxations of the power flows, several papers showing that the second-order cone relaxation is tight for tree networks under various conditions on loads or voltages. This paper shows that AC-feasibility, i.e., to find whether some generator dispatch can satisfy a given demand, is NP-Hard for tree networks.

Discussion (0). Continue with ORCID to comment.

Pith tools