Mikhail Batsyn

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