67 citations · 70 across the 12 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
math.OC2022
Strengthening SONC Relaxations with Constraints Derived from Variable Bounds
Ksenia Bestuzheva, Ambros Gleixner, Helena Völker
Certificates of polynomial nonnegativity can be used to obtain tight dual bounds for polynomial optimization problems. We consider Sums of Nonnegative Circuit (SONC) polynomials ce…
math.OC2022★ 1 cited
Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Terms
Ksenia Bestuzheva, Ambros Gleixner, Tobias Achterberg
The reformulation-linearization technique (RLT) is a prominent approach to constructing tight linear relaxations of non-convex continuous and mixed-integer optimization problems. T…