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:
Collaborative distances:
Timeline
2014
2015
2016
2017
2018
2019
2020
2021
0
1
2
3
4
1
1
3
1
2
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2021
The Branch-and-Bound Algorithm for the Traveling Salesman Problem is Not a Direct Algorithm.
Autom. Control. Comput. Sci., 2021
2018
Branch and bound algorithm for the traveling salesman problem is not a direct type algorithm.
CoRR, 2018
2017
CoRR, 2017
2015
2014
CoRR, 2014