58 citations · 86 across the 9 of their papers we have counts for
6 papers · 1 filter
Tight bounds on the maximal perimeter of convex equilateral small polygons
Christian Bingane, Charles Audet
A small polygon is a polygon that has diameter one. The maximal perimeter of a convex equilateral small polygon with sides is not known when . In this paper, we co…
Tight bounds on the maximal perimeter and the maximal width of convex small polygons
Christian Bingane
A small polygon is a polygon of unit diameter. The maximal perimeter and the maximal width of a convex small polygon with vertices are not known when . In this pap…
Largest small polygons: A sequential convex optimization approach
Christian Bingane
A small polygon is a polygon of unit diameter. The maximal area of a small polygon with vertices is not known when . Finding the largest small -gon for a given nu…
Tight-and-cheap conic relaxation for the AC optimal power flow problem
Christian Bingane, Miguel F. Anjos, Sébastien Le Digabel
The classical alternating current optimal power flow problem is highly nonconvex and generally hard to solve. Convex relaxations, in particular semidefinite, second-order cone, con…
CONICOPF: Conic relaxations for AC optimal power flow computations
Christian Bingane, Miguel F. Anjos, Sébastien Le Digabel
Computational speed and global optimality are key needs for practical algorithms for the optimal power flow problem. Two convex relaxations offer a favorable trade-off between the…
Tight-and-cheap conic relaxation for the optimal reactive power dispatch problem
Christian Bingane, Miguel F. Anjos, Sébastien Le Digabel
The optimal reactive power dispatch (ORPD) problem is an alternating current optimal power flow (ACOPF) problem where discrete control devices for regulating the reactive power, su…