Mikhail Batsyn

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

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 Computers & Operations Research	2018-07-11	Paper
Improved infra-chromatic bound for exact maximum clique search	2018-05-17	Paper
Heuristic for maximizing grouping efficiency in the cell formation problem Springer Proceedings in Mathematics & Statistics	2018-02-14	Paper
A Branch and Bound Algorithm for a Fractional 0-1 Programming Problem Discrete Optimization and Operations Research	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 Optimization Methods & Software	2017-06-21	Paper
Infra-chromatic bound for exact maximum clique search Computers & Operations Research	2016-11-17	Paper
Heuristic algorithm for the cell formation problem Springer Proceedings in Mathematics & Statistics	2016-09-13	Paper
Speeding up MCS algorithm for the maximum clique problem with ILS heuristic and other enhancements Springer Proceedings in Mathematics & Statistics	2016-09-13	Paper
Lower and upper bounds for the preemptive single machine scheduling problem with equal processing times Springer Proceedings in Mathematics & Statistics	2016-09-13	Paper
Tolerance-based vs. cost-based branching for the asymmetric capacitated vehicle routing problem Springer Proceedings in Mathematics & Statistics	2016-09-13	Paper
A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations Journal of Combinatorial Optimization	2016-05-11	Paper
Exact model for the cell formation problem Optimization Letters	2014-12-05	Paper
Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time Optimization Methods & Software	2014-10-29	Paper
Speeding up branch and bound algorithms for solving the maximum clique problem Journal of Global Optimization	2014-07-03	Paper
Improvements to MCS algorithm for the maximum clique problem Journal of Combinatorial Optimization	2014-04-08	Paper
Power index axiomatics in the problem of voting with quota Automation and Remote Control	2011-11-24	Paper

Research outcomes over time

This page was built for person: Mikhail Batsyn