Heuristic for a Real-life Truck and Trailer Routing Problem. - Mikhail Batsyn; Alexander Ponomarenko (ITQM, 2014)

A Dynamic Programming Heuristic for Optimizing Slot Sizes in a Warehouse. - Pavel Sukhov; Mikhail Batsyn; Petr Terentev (ITQM, 2014)

Initial Sorting of Vertices in the Maximum Clique Problem Reviewed. - Pablo San Segundo; Alvaro Lopez; Mikhail Batsyn (LION, 2014)

Improvements to MCS algorithm for the maximum clique problem. - Mikhail Batsyn; Boris Goldengorin; Evgeny Maslov; Panos M. Pardalos (J. Comb. Optim., 2014)

Speeding up branch and bound algorithms for solving the maximum clique problem. - Evgeny Maslov; Mikhail Batsyn; Panos M. Pardalos (J. Glob. Optim., 2014)

Exact model for the cell formation problem. - Ilya Bychkov; Mikhail Batsyn; Panos M. Pardalos (Optim. Lett., 2014)

Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time. - Mikhail Batsyn; Boris Goldengorin; Panos M. Pardalos; Pavel Sukhov (Optim. Methods Softw., 2014)

Reusing the Same Coloring in the Child Nodes of the Search Tree for the Maximum Clique Problem. - Alexey Nikolaev; Mikhail Batsyn; Pablo San Segundo (LION, 2015)

Heuristic for Site-Dependent Truck and Trailer Routing Problem with Soft and Hard Time Windows and Split Deliveries. - Mikhail Batsyn; Alexander Ponomarenko (MOD, 2015)

Infra-chromatic bound for exact maximum clique search. - Pablo San Segundo; Alexey Nikolaev; Mikhail Batsyn (Comput. Oper. Res., 2015)

A Branch and Bound Algorithm for a Fractional 0-1 Programming Problem. - Irina Utkina; Mikhail Batsyn; Ekaterina Batsyna (DOOR, 2016)

Improved initial vertex ordering for exact maximum clique search. - Pablo San Segundo; Alvaro Lopez; Mikhail Batsyn; Alexey Nikolaev; Panos M. Pardalos (Appl. Intell., 2016)

Improved Infra-Chromatic Bound for Exact Maximum Clique Search. - Pablo San Segundo; Alexey Nikolaev; Mikhail Batsyn; Panos M. Pardalos (Informatica, 2016)

A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations. - Larisa Komosko; Mikhail Batsyn; Pablo San Segundo; Panos M. Pardalos (J. Comb. Optim., 2016)

Erratum to: Improved initial vertex ordering for exact maximum clique search. - Pablo San Segundo; Alvaro Lopez; Mikhail Batsyn; Alexey Nikolaev; Panos M. Pardalos (Appl. Intell., 2017)

Heuristic for Maximizing Grouping Efficiency in the Cell Formation Problem. - Ilya Bychkov; Mikhail Batsyn; Panos M. Pardalos (CoRR, 2017)

A Model of Optimal Network Structure for Decentralized Nearest Neighbor Search. - Alexander Ponomarenko; Irina Utkina; Mikhail Batsyn (CoRR, 2017)

An enhanced bitstring encoding for exact maximum clique search in sparse graphs. - Pablo San Segundo; Jorge Artieda; Mikhail Batsyn; Panos M. Pardalos (Optim. Methods Softw., 2017)

Branch-and-Bound Algorithm for Symmetric Travelling Salesman Problem. - Alexey Nikolaev; Mikhail Batsyn (IWOCA, 2018)

An efficient exact model for the cell formation problem with a variable number of production cells. - Ilya Bychkov; Mikhail Batsyn (Comput. Oper. Res., 2018)

A branch-and-bound algorithm for the cell formation problem. - Irina Utkina; Mikhail V. Batsyn; Ekaterina K. Batsyna (Int. J. Prod. Res., 2018)

On NP-completeness of the cell formation problem. - Mikhail V. Batsyn; Ekaterina K. Batsyna; Ilya S. Bychkov (CoRR, 2019)

NP-completeness of cell formation problem with grouping efficacy objective. - Mikhail V. Batsyn; Ekaterina K. Batsyna; Ilya S. Bychkov (Int. J. Prod. Res., 2020)

Vehicle assignment in site-dependent vehicle routing problems with split deliveries. - Mikhail V. Batsyn; Ekaterina K. Batsyna; Ilya S. Bychkov; Panos M. Pardalos (Oper. Res., 2021)