11 citations · 19 across the 10 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
cs.CC2014
Complexity of LP in Terms of the Face Lattice
Aleksandr Maksimenko
Let be a finite set in . We consider the problem of optimizing linear function on , where is an input vector. We call it a problem . A prob…
cs.CC2014★ 11 cited
A special role of Boolean quadratic polytopes among other combinatorial polytopes
Aleksandr Maksimenko
We consider several families of combinatorial polytopes associated with the following NP-complete problems: maximum cut, Boolean quadratic programming, quadratic linear ordering, q…
math.OC2014★ 4 cited
Small Extended Formulations for Cyclic Polytopes
Yuri Bogomolov, Samuel Fiorini, Aleksandr Maksimenko +1
We provide an extended formulation of size O(log n)^{\lfloor d/2 \rfloor} for the cyclic polytope with dimension d and n vertices (i,i^2,\ldots,i^d), i in [n]. First, we find an ex…