16 citations · 19 across the 2 of their papers we have counts for
2 papers
cs.CC2014★ 16 cited
The Complexity of DC-Switching Problems
Karsten Lehmann, Alban Grastien, Pascal Van Hentenryck
This report provides a comprehensive complexity study of line switching in the Linear DC model for the feasibility problem and the optimization problems of maximizing the load that…
cs.CC2014★ 3 cited
AC-Feasibility on Tree Networks is NP-Hard
Karsten Lehmann, Alban Grastien, Pascal Van Hentenryck
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 u…