Mikhail Batsyn

Available identifiers

zbMath Open batsyn.mikhail-vMaRDI QIDQ281814

List of research outcomes

Publication	Date of Publication	Type
Branch-and-bound algorithm for Symmetric Travelling Salesman problem	2018-09-06	Paper
An efficient exact model for the cell formation problem with a variable number of production cells	2018-07-11	Paper
https://portal.mardi4nfdi.de/entity/Q4640250	2018-05-17	Paper
Heuristic for Maximizing Grouping Efficiency in the Cell Formation Problem	2018-02-14	Paper
A Branch and Bound Algorithm for a Fractional 0-1 Programming Problem	2018-02-13	Paper
Comparison of robustness of statistical procedures for network structure analysis	2018-01-30	Paper
An enhanced bitstring encoding for exact maximum clique search in sparse graphs	2017-06-21	Paper
Infra-chromatic bound for exact maximum clique search	2016-11-17	Paper
Heuristic Algorithm for the Cell Formation Problem	2016-09-13	Paper
Speeding up MCS Algorithm for the Maximum Clique Problem with ILS Heuristic and Other Enhancements	2016-09-13	Paper
Lower and Upper Bounds for the Preemptive Single Machine Scheduling Problem with Equal Processing Times	2016-09-13	Paper
Tolerance-Based vs. Cost-Based Branching for the Asymmetric Capacitated Vehicle Routing Problem	2016-09-13	Paper
A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations	2016-05-11	Paper
Exact model for the cell formation problem	2014-12-05	Paper
Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time	2014-10-29	Paper
Speeding up branch and bound algorithms for solving the maximum clique problem	2014-07-03	Paper
Improvements to MCS algorithm for the maximum clique problem	2014-04-08	Paper
Power index axiomatics in the problem of voting with quota	2011-11-24	Paper

Research outcomes over time

This page was built for person: Mikhail Batsyn