16 citations · 24 across the 6 of their papers we have counts for
3 papers · 1 filter
The Complexity of Switching and FACTS Maximum-Potential-Flow Problems
Karsten Lehmann, Alban Grastien, Pascal Van Hentenryck
This papers considers the problem of maximizing the load that can be served by a power network. We use the commonly accepted Linear DC power network model and consider wo configura…
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…
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…