A special place of Boolean quadratic polytopes among other combinatorial polytopes. - Aleksandr N. Maksimenko (CoRR, 2014)

Complexity of LP in Terms of the Face Lattice. - Aleksandr N. Maksimenko (CoRR, 2014)

Small Extended Formulations for Cyclic Polytopes. - Yuri Bogomolov; Samuel Fiorini; Aleksandr N. Maksimenko; Kanstantsin Pashkovich (Discret. Comput. Geom., 2015)

On the family of 0/1-polytopes with NP-complete non-adjacency relation. - Alexander N. Maksimenko (CoRR, 2017)

Boolean quadric polytopes are faces of linear ordering polytopes. - Aleksandr N. Maksimenko (CoRR, 2017)

Affine maps between graph isomorphism polytopes and Boolean quadratic polytopes. - Aleksandr N. Maksimenko (CoRR, 2017)

Branch and bound algorithm for the traveling salesman problem is not a direct type algorithm. - Aleksandr N. Maksimenko (CoRR, 2018)

The Branch-and-Bound Algorithm for the Traveling Salesman Problem is Not a Direct Algorithm. - Aleksandr N. Maksimenko (Autom. Control. Comput. Sci., 2021)