Mikhail Batsyn

Publication Activity (10 Years)

Years Active: 2014-2018
Publications (10 Years): 12

Top Topics

Dynamic Programming

Branch And Bound

Combinatorial Optimization

Top Venues

J. Comb. Optim.

Comput. Oper. Res.

Publications

Alexey Nikolaev, Mikhail Batsyn
Branch-and-Bound Algorithm for Symmetric Travelling Salesman Problem. IWOCA (2018)
Ilya Bychkov, Mikhail Batsyn
An efficient exact model for the cell formation problem with a variable number of production cells. Comput. Oper. Res. 91 (2018)
Ilya Bychkov, Mikhail Batsyn
An efficient exact model for the cell formation problem with a variable number of production cells. CoRR (2017)
Alexander Ponomarenko, Irina Utkina, Mikhail Batsyn
A Model of Optimal Network Structure for Decentralized Nearest Neighbor Search. CoRR (2017)
Pablo San Segundo, Jorge Artieda, Mikhail Batsyn, Panos M. Pardalos
An enhanced bitstring encoding for exact maximum clique search in sparse graphs. Optim. Methods Softw. 32 (2) (2017)
Pablo San Segundo, Alvaro Lopez, Mikhail Batsyn, Alexey Nikolaev, Panos M. Pardalos
Erratum to: Improved initial vertex ordering for exact maximum clique search. Appl. Intell. 46 (1) (2017)
Ilya Bychkov, Mikhail Batsyn, Panos M. Pardalos
Heuristic for Maximizing Grouping Efficiency in the Cell Formation Problem. CoRR (2017)
Larisa Komosko, Mikhail Batsyn, Pablo San Segundo, Panos M. Pardalos
A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations. J. Comb. Optim. 31 (4) (2016)
Irina Utkina, Mikhail Batsyn, Ekaterina Batsyna
A Branch and Bound Algorithm for a Fractional 0-1 Programming Problem. DOOR (2016)
Pablo San Segundo, Alvaro Lopez, Mikhail Batsyn, Alexey Nikolaev, Panos M. Pardalos
Improved initial vertex ordering for exact maximum clique search. Appl. Intell. 45 (3) (2016)
Pablo San Segundo, Alexey Nikolaev, Mikhail Batsyn, Panos M. Pardalos
Improved Infra-Chromatic Bound for Exact Maximum Clique Search. Informatica 27 (2) (2016)
Irina Utkina, Mikhail Batsyn, Ekaterina Batsyna
A branch and bound algorithm for a fractional 0-1 programming problem. CoRR (2016)
Mikhail Batsyn, Alexander Ponomarenko
Heuristic for Site-Dependent Truck and Trailer Routing Problem with Soft and Hard Time Windows and Split Deliveries. MOD (2015)
Alexey Nikolaev, Mikhail Batsyn, Pablo San Segundo
Reusing the Same Coloring in the Child Nodes of the Search Tree for the Maximum Clique Problem. LION (2015)
Pablo San Segundo, Alexey Nikolaev, Mikhail Batsyn
Infra-chromatic bound for exact maximum clique search. Comput. Oper. Res. 64 (2015)
Evgeny Maslov, Mikhail Batsyn, Panos M. Pardalos
Speeding up branch and bound algorithms for solving the maximum clique problem. J. Glob. Optim. 59 (1) (2014)
Mikhail Batsyn, Boris Goldengorin, Evgeny Maslov, Panos M. Pardalos
Improvements to MCS algorithm for the maximum clique problem. J. Comb. Optim. 27 (2) (2014)
Mikhail Batsyn, Boris Goldengorin, Panos M. Pardalos, Pavel Sukhov
Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time. Optim. Methods Softw. 29 (5) (2014)
Pavel Sukhov, Mikhail Batsyn, Petr Terentev
A Dynamic Programming Heuristic for Optimizing Slot Sizes in a Warehouse. ITQM (2014)
Ilya Bychkov, Mikhail Batsyn, Panos M. Pardalos
Exact model for the cell formation problem. Optim. Lett. 8 (8) (2014)
Mikhail Batsyn, Alexander Ponomarenko
Heuristic for a Real-life Truck and Trailer Routing Problem. ITQM (2014)
Pablo San Segundo, Alvaro Lopez, Mikhail Batsyn
Initial Sorting of Vertices in the Maximum Clique Problem Reviewed. LION (2014)