| Infra-chromatic bound for exact maximum clique search P San Segundo, A Nikolaev, M Batsyn Computers & Operations Research 64, 293-303, 2015 | 42 | 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 | 15 | 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 | 15 | 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 | 8 | 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 | 4 | 2017 |
| Branch-and-Bound Algorithm for Symmetric Travelling Salesman Problem A Nikolaev, M Batsyn International Workshop on Combinatorial Algorithms, 311-322, 2018 | 2 | 2018 |
| Tabu Search for Fleet Size and Mix Vehicle Routing Problem with Hard and Soft Time Windows M Batsyn, I Bychkov, L Komosko, A Nikolaev International Conference on Network Analysis, 3-18, 2016 | 2 | 2016 |
| Эффективный подход на основе машинного обучения к pешению задачи о максимальной клике АИ Николаев Информационные технологии 22 (4), 249-254, 2016 | | 2016 |
Mikhail BatsynNational Research University Higher School of EconomicsVerified email at hse.ru
