Aleksandr N. Maksimenko

Publication Activity (10 Years)

Years Active: 2014-2021
Publications (10 Years): 5

Top Topics

Graph Isomorphism

Branch And Bound

Finding An Optimal Solution

Top Venues

Autom. Control. Comput. Sci.

Discret. Comput. Geom.

Publications

Aleksandr N. Maksimenko
The Branch-and-Bound Algorithm for the Traveling Salesman Problem is Not a Direct Algorithm. Autom. Control. Comput. Sci. 55 (7) (2021)
Aleksandr N. Maksimenko
Branch and bound algorithm for the traveling salesman problem is not a direct type algorithm. CoRR (2018)
Aleksandr N. Maksimenko
Affine maps between graph isomorphism polytopes and Boolean quadratic polytopes. CoRR (2017)
Aleksandr N. Maksimenko
Boolean quadric polytopes are faces of linear ordering polytopes. CoRR (2017)
Yuri Bogomolov, Samuel Fiorini, Aleksandr N. Maksimenko, Kanstantsin Pashkovich
Small Extended Formulations for Cyclic Polytopes. Discret. Comput. Geom. 53 (4) (2015)
Aleksandr N. Maksimenko
A special place of Boolean quadratic polytopes among other combinatorial polytopes. CoRR (2014)
Aleksandr N. Maksimenko
Complexity of LP in Terms of the Face Lattice. CoRR (2014)