11 citations · 19 across the 10 of their papers we have counts for
Showing 2014 · cs.CCShow all
2 papers · 2 filters
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…