11 citations · 19 across the 10 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
cs.CC2017
Affine maps between quadratic assignment polytopes and subgraph isomorphism polytopes
Aleksandr Maksimenko
We consider two polytopes. The quadratic assignment polytope is the convex hull of the set of tensors , , where is the set of perm…
cs.CC2017
Boolean quadric polytopes are faces of linear ordering polytopes
Aleksandr Maksimenko
Let be a boolean quadric polytope, be a linear ordering polytope. It is shown that is linearly isomorphic to a face of .
cs.CC2017
On the family of 0/1-polytopes with NP-complete non-adjacency relation
Alexander Maksimenko
In 1995 T. Matsui considered a special family 0/1-polytopes for which the problem of recognizing the non-adjacency of two arbitrary vertices is NP-complete. In 2012 the author of t…