Mikhail Batsyn

发表

A Branch and Bound Algorithm for a Fractional 0-1 Programming Problem

Irina Utkina, Mikhail Batsyn, Ekaterina Batsyna, 2016 .

A branch-and-bound algorithm for the cell formation problem

Irina Utkina, Mikhail Batsyn, Ekaterina Batsyna, 2018, Int. J. Prod. Res..

Models, Algorithms and Technologies for Network Analysis: From the Third International Conference on Network Analysis

Panos M. Pardalos, Mikhail Batsyn, Valery A. Kalyagin, 2014 .

A Dynamic Programming Heuristic for Optimizing Slot Sizes in a Warehouse

Mikhail Batsyn, Pavel Sukhov, Petr Terentev, 2014, ITQM.

Improved Infra-Chromatic Bound for Exact Maximum Clique Search

Panos M. Pardalos, Pablo San Segundo, Mikhail Batsyn, 2016, Informatica.

Fast Heuristic for Vehicle Routing Problem on Trees

Mikhail Batsyn, Irina Utkina, Olga Bukanova, 2020 .

Heuristic for a Real-life Truck and Trailer Routing Problem

Mikhail Batsyn, Alexander Ponomarenko, 2014, ITQM.

Speeding up MCS Algorithm for the Maximum Clique Problem with ILS Heuristic and Other Enhancements

Panos M. Pardalos, Mikhail Batsyn, Evgeny Maslov, 2013 .

Heuristic Algorithm for the Cell Formation Problem

Panos M. Pardalos, Mikhail Batsyn, Ilya Bychkov, 2013 .

Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time

Panos M. Pardalos, Boris Goldengorin, Mikhail Batsyn, 2014, Optim. Methods Softw..

An enhanced bitstring encoding for exact maximum clique search in sparse graphs

Panos M. Pardalos, Pablo San Segundo, Jorge Artieda, 2017, Optim. Methods Softw..

Pattern-Based Heuristic for the Cell Formation Problem in Group Technology

Panos M. Pardalos, Boris Goldengorin, Mikhail Batsyn, 2013 .

Initial Sorting of Vertices in the Maximum Clique Problem Reviewed

Pablo San Segundo, Mikhail Batsyn, Alvaro Lopez, 2014, LION.

Branch-and-Bound Algorithm for Symmetric Travelling Salesman Problem

Mikhail Batsyn, Alexey Nikolaev, M. Batsyn, 2018, IWOCA.

Tabu Search for Fleet Size and Mix Vehicle Routing Problem with Hard and Soft Time Windows

Mikhail Batsyn, Alexey Nikolaev, Ilya Bychkov, 2016 .

A Branch and Bound Algorithm for a Fractional 0-1 Programming Problem pdf

Irina Utkina, Mikhail Batsyn, Ekaterina Batsyna, 2016, DOOR.

Lower and Upper Bounds for the Preemptive Single Machine Scheduling Problem with Equal Processing Times

Panos M. Pardalos, Boris Goldengorin, Mikhail Batsyn, 2013 .

Exact model for the cell formation problem

Panos M. Pardalos, Mikhail Batsyn, Ilya Bychkov, 2014, Optim. Lett..

Heuristic for Site-Dependent Truck and Trailer Routing Problem with Soft and Hard Time Windows and Split Deliveries

Mikhail Batsyn, Alexander Ponomarenko, 2015, MOD.

A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations

Panos M. Pardalos, Pablo San Segundo, Mikhail Batsyn, 2016, J. Comb. Optim..

Erratum to: Improved initial vertex ordering for exact maximum clique search

Panos M. Pardalos, Pablo San Segundo, Mikhail Batsyn, 2016, Applied intelligence (Boston).

Reusing the Same Coloring in the Child Nodes of the Search Tree for the Maximum Clique Problem

Pablo San Segundo, Mikhail Batsyn, Alexey Nikolaev, 2015, LION.

Infra-chromatic bound for exact maximum clique search

Pablo San Segundo, Mikhail Batsyn, Alexey Nikolaev, 2015, Comput. Oper. Res..

A Branch and Bound Algorithm for the Cell Formation Problem

Irina Utkina, Mikhail Batsyn, 2014 .

Heuristic for Maximizing Grouping Efficiency in the Cell Formation Problem pdf

Panos M. Pardalos, Mikhail Batsyn, Ilya Bychkov, 2016, ArXiv.

Improvements to MCS algorithm for the maximum clique problem

Panos M. Pardalos, Boris Goldengorin, Mikhail Batsyn, 2014, J. Comb. Optim..

Speeding up branch and bound algorithms for solving the maximum clique problem

Mikhail Batsyn, Panos M. Pardalos, Evgeny Maslov, 2013, Journal of Global Optimization.

Vehicle assignment in site-dependent vehicle routing problems with split deliveries

Panos M. Pardalos, Mikhail Batsyn, Ekaterina Batsyna, 2019, Oper. Res..

Improved initial vertex ordering for exact maximum clique search

Panos M. Pardalos, Pablo San Segundo, Mikhail Batsyn, 2016, Applied Intelligence.

A Model of Optimal Network Structure for Decentralized Nearest Neighbor Search pdf

Irina Utkina, Mikhail Batsyn, Alexander Ponomarenko, 2016, ArXiv.

An efficient exact model for the cell formation problem with a variable number of production cells pdf

Mikhail Batsyn, Ilya Bychkov, M. Batsyn, 2017, Comput. Oper. Res..

Tolerance-Based vs. Cost-Based Branching for the Asymmetric Capacitated Vehicle Routing Problem

Panos M. Pardalos, Boris Goldengorin, Mikhail Batsyn, 2013 .

Dynamics of cluster structures in a financial market network

Panos M. Pardalos, Mikhail Batsyn, Anton Kocheturov, 2014 .

Constructive Nonsmooth Analysis and Related Topics

Panos M. Pardalos, Mikhail Batsyn, Vladimir F. Demyanov, 2013 .

A Hybrid Approach for the Capacitated Vehicle Routing Problem with Time Windows

Mikhail Batsyn, Ilya Bychkov, 2018 .