| Infra-chromatic bound for exact maximum clique search P San Segundo, A Nikolaev, M Batsyn Computers & Operations Research 64, 293-303, 2015 | 54 | 2015 |
| Improved initial vertex ordering for exact maximum clique search P San Segundo, A Lopez, M Batsyn, A Nikolaev, PM Pardalos Applied Intelligence 45 (3), 868-880, 2016 | 27 | 2016 |
| Improved Infra-Chromatic Bound for Exact Maximum Clique Search P San Segundo, A Nikolaev, M Batsyn, PM Pardalos INFORMATICA 27 (2), 463-487, 2016 | 22 | 2016 |
| Reusing the Same Coloring in the Child Nodes of the Search Tree for the Maximum Clique Problem A Nikolaev, M Batsyn, P San Segundo International Conference on Learning and Intelligent Optimization, 275-280, 2015 | 12 | 2015 |
| J-means and I-means for minimum sum-of-squares clustering on networks A Nikolaev, N Mladenović, R Todosijević Optimization Letters 11 (2), 359-376, 2017 | 7 | 2017 |
| Tabu search for fleet size and mix vehicle routing problem with hard and soft time windows M Batsyn, I Bychkov, L Komosko, A Nikolaev Computational Aspects and Applications in Large-Scale Networks: NET 2017 …, 2018 | 6 | 2018 |
| Branch-and-bound algorithm for symmetric travelling salesman problem A Nikolaev, M Batsyn Combinatorial Algorithms: 29th International Workshop, IWOCA 2018, Singapore …, 2018 | 4 | 2018 |
| Эффективный подход на основе машинного обучения к pешению задачи о максимальной клике АИ Николаев Информационные технологии 22 (4), 249-254, 2016 | 1 | 2016 |
Mikhail BatsynNational Research University Higher School of EconomicsVerified email at hse.ru
