52 citations · 216 across the 27 of their papers we have counts for
Showing 2014 · math.OCShow all
2 papers · 2 filters
math.OC2014★ 18 cited
On linear relaxations of OPF problems
Daniel Bienstock, Gonzalo Munoz
We present lifted linear relaxations of the OPF problem.
math.OC2014★ 3 cited
A note on polynomial solvability of the CDT problem
Daniel Bienstock
We describe a simple polynomial-time algorithm for the CDT problem that relies on a construction of Barvinok.