2 citations · 2 across the 3 of their papers we have counts for
5 papers
All 2-neighborly d-polytopes with at most d + 9 facets
Aleksandr N. Maksimenko, Dmitry V. Gribanov, Dmitry S. Malyshev
We give a complete enumeration of all 2-neighborly -polytopes with and less facets. All of them are realized as 0/1-polytopes, except a 6-polytope with 10 ve…
2-neighborly 0/1-polytopes of dimension 7
Aleksandr Maksimenko
We give a complete enumeration of all 2-neighborly 0/1-polytopes of dimension 7. There are 13 959 358 918 different 0/1-equivalence classes of such polytopes. They form 5 850 402 0…
Branch and bound algorithm for the traveling salesman problem is not a direct type algorithm
Aleksandr Maksimenko
In this paper, we consider the notion of a direct type algorithm introduced by V.A. Bondarenko in 1983. A direct type algorithm is a linear decision tree with some special properti…
On the minimum number of facets of a 2-neighborly polytope
Aleksandr Maksimenko
Let (respectively, ) be the minimal number of facets of a (simplicial) 2-neighborly -polytope with vertices, $v > d \ge 4…
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…