We stand with Ukraine  

Aleksandr N. Maksimenko

Orcid: 0000-0002-0887-1500

According to our database1, Aleksandr N. Maksimenko authored at least 8 papers between 2014 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

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

2018
Branch and bound algorithm for the traveling salesman problem is not a direct type algorithm.
[BibTeX]
[DOI]
Aleksandr N. Maksimenko
CoRR, 2018

2017
Affine maps between graph isomorphism polytopes and Boolean quadratic polytopes.
[BibTeX]
[DOI]
Aleksandr N. Maksimenko
CoRR, 2017

Boolean quadric polytopes are faces of linear ordering polytopes.
[BibTeX]
[DOI]
Aleksandr N. Maksimenko
CoRR, 2017

On the family of 0/1-polytopes with NP-complete non-adjacency relation.
[BibTeX]
[DOI]
Alexander N. Maksimenko
CoRR, 2017

2015
Small Extended Formulations for Cyclic Polytopes.
[BibTeX]
[DOI]
Yuri Bogomolov
,
Samuel Fiorini
,
Aleksandr N. Maksimenko
,
Kanstantsin Pashkovich
Discret. Comput. Geom., 2015

2014
Complexity of LP in Terms of the Face Lattice.
[BibTeX]
[DOI]
Aleksandr N. Maksimenko
CoRR, 2014

A special place of Boolean quadratic polytopes among other combinatorial polytopes.
[BibTeX]
[DOI]
Aleksandr N. Maksimenko
CoRR, 2014


  Loading...