Mikhail Batsyn

From MaRDI portal
Person:281814

Available identifiers

zbMath Open batsyn.mikhail-vMaRDI QIDQ281814

List of research outcomes





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

Research outcomes over time

This page was built for person: Mikhail Batsyn