Mikhail Batsyn
Mikhail Batsyn
Подтвержден адрес электронной почты в домене hse.ru - Главная страница
Название
Процитировано
Процитировано
Год
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
552014
Infra-chromatic bound for exact maximum clique search
P San Segundo, A Nikolaev, M Batsyn
Computers & Operations Research 64, 293-303, 2015
432015
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
372014
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
352014
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
222018
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
212014
Heuristic for a real-life truck and trailer routing problem
M Batsyn, A Ponomarenko
Procedia Computer Science 31, 778-792, 2014
192014
Exact model for the cell formation problem
I Bychkov, M Batsyn, PM Pardalos
Optimization Letters 8 (8), 2203-2210, 2014
182014
Improved infra-chromatic bound for exact maximum clique search
P San Segundo, A Nikolaev, M Batsyn, PM Pardalos
Informatica 27 (2), 463-487, 2016
162016
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
152016
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
122018
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
112013
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
102016
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
102014
A branch and bound algorithm for a fractional 0-1 programming problem
I Utkina, M Batsyn, E Batsyna
International Conference on Discrete Optimization and Operations Research …, 2016
92016
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
82015
Constructive Nonsmooth Analysis and Related Topics
VF Demyanov
Springer, 2014
82014
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
82013
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
72017
NP-completeness of cell formation problem with grouping efficacy objective
MV Batsyn, EK Batsyna, IS Bychkov
International Journal of Production Research 58 (20), 6159-6169, 2020
62020
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20