Christian Bingane
RetourPublications
Cahiers du GERAD
A small polygon is a polygon of unit diameter. The maximal area of a small polygon with \(n=2m\)
vertices is not known when \(m \ge 7\)
. In this paper, w...
A small polygon is a polygon of unit diameter. The maximal width of an equilateral small polygon with \(n=2^s\)
vertices is not known when \(s \ge 3\)
. T...
A small polygon is a polygon of unit diameter. The maximal perimeter and the maximal width of a convex small polygon with \(n=2^s\)
sides are unknown when ...
A small polygon is a polygon of unit diameter. The maximal perimeter of a convex equilateral small polygon with \(n=2^s\)
vertices is not known when `(s ...
A small polygon is a polygon of unit diameter. The maximal perimeter and the maximal width of a convex small polygon with \(n=2^s\)
vertices are not known ...
A small polygon is a polygon of unit diameter. The maximal area of a small polygon with \(n=2m\)
vertices is not known when \(m\ge 7\)
. Finding the large...
Computational speed and global optimality are a key need for pratical algorithms of the OPF problem. Recently, we proposed a tight-and-cheap conic relaxation...
référence BibTeX
The optimal reactive power dispatch (ORPD) problem is an alternating current optimal power flow (ACOPF) problem where discrete control devices for regulating...
référence BibTeX
The classical alternating current optimal power flow problem is highly nonconvex and generally hard to solve. Convex relaxations, in particular semidefinite,...
référence BibTeX