Mikhail Batsyn
TitleCited byYear
Improvements to MCS algorithm for the maximum clique problem
M Batsyn, B Goldengorin, E Maslov, PM Pardalos
Journal of Combinatorial Optimization 27 (2), 397-416, 2014
442014
Infra-chromatic bound for exact maximum clique search
P San Segundo, A Nikolaev, M Batsyn
Computers & Operations Research 64, 293-303, 2015
332015
Dynamics of cluster structures in a financial market network
A Kocheturov, M Batsyn, PM Pardalos
Physica A: Statistical Mechanics and its Applications 413, 523-533, 2014
232014
Speeding up branch and bound algorithms for solving the maximum clique problem
E Maslov, M Batsyn, PM Pardalos
Journal of Global Optimization 59 (1), 1-21, 2014
222014
Exact model for the cell formation problem
I Bychkov, M Batsyn, PM Pardalos
Optimization Letters 8 (8), 2203-2210, 2014
132014
Improved infra-chromatic bound for exact maximum clique search
P San Segundo, A Nikolaev, M Batsyn, PM Pardalos
Informatica 27 (2), 463-487, 2016
122016
Heuristic for a real-life truck and trailer routing problem
M Batsyn, A Ponomarenko
Procedia Computer Science 31, 778-792, 2014
102014
Pattern-based heuristic for the cell formation problem in group technology
M Batsyn, I Bychkov, B Goldengorin, P Pardalos, P Sukhov
Models, algorithms, and technologies for network analysis, 11-50, 2013
102013
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
82016
Initial sorting of vertices in the maximum clique problem reviewed
P San Segundo, A Lopez, M Batsyn
International Conference on Learning and Intelligent Optimization, 111-120, 2014
82014
An efficient exact model for the cell formation problem with a variable number of production cells
I Bychkov, M Batsyn
Computers & Operations Research 91, 112-120, 2018
72018
Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time
M Batsyn, B Goldengorin, PM Pardalos, P Sukhov
Optimization Methods and Software 29 (5), 955-963, 2014
72014
Heuristic algorithm for the cell formation problem
I Bychkov, M Batsyn, P Sukhov, PM Pardalos
Models, Algorithms, and Technologies for Network Analysis, 43-69, 2013
72013
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
62015
Constructive Nonsmooth Analysis and Related Topics
VF Demyanov, PM Pardalos, M Batsyn
Springer, 2014
62014
An enhanced bitstring encoding for exact maximum clique search in sparse graphs
P San Segundo, J Artieda, M Batsyn, PM Pardalos
Optimization Methods and Software 32 (2), 312-335, 2017
52017
Pattern-Based Heuristic for the Cell Formation Problem in Group Technology
M Batsyn, I Bychkov, B Goldengorin, PM Pardalos, P Sukhov
Models, Algorithms, and Technologies for Network Analysis: Proceedings of …, 2012
52012
A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations
L Komosko, M Batsyn, P San Segundo, PM Pardalos
Journal of Combinatorial Optimization 31 (4), 1665-1677, 2016
42016
An analytical expression for the distribution of the sum of random variables with a mixed uniform density and mass function
M Batsyn, V Kalyagin
Models, Algorithms, and Technologies for Network Analysis, 51-63, 2013
42013
A branch-and-bound algorithm for the cell formation problem
IE Utkina, MV Batsyn, EK Batsyna
International Journal of Production Research 56 (9), 3262-3273, 2018
3*2018
The system can't perform the operation now. Try again later.
Articles 1–20