Mikhail Batsyn

Orcid: 0000-0002-0302-2673

According to our database1, Mikhail Batsyn authored at least 24 papers between 2014 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Vehicle assignment in site-dependent vehicle routing problems with split deliveries.
Oper. Res., 2021

2020
NP-completeness of cell formation problem with grouping efficacy objective.
Int. J. Prod. Res., 2020

2019
On NP-completeness of the cell formation problem.
CoRR, 2019

2018
A branch-and-bound algorithm for the cell formation problem.
Int. J. Prod. Res., 2018

An efficient exact model for the cell formation problem with a variable number of production cells.
Comput. Oper. Res., 2018

Branch-and-Bound Algorithm for Symmetric Travelling Salesman Problem.
Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

2017
An enhanced bitstring encoding for exact maximum clique search in sparse graphs.
Optim. Methods Softw., 2017

A Model of Optimal Network Structure for Decentralized Nearest Neighbor Search.
CoRR, 2017

Heuristic for Maximizing Grouping Efficiency in the Cell Formation Problem.
CoRR, 2017

Erratum to: Improved initial vertex ordering for exact maximum clique search.
Appl. Intell., 2017

2016
A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations.
J. Comb. Optim., 2016

Improved Infra-Chromatic Bound for Exact Maximum Clique Search.
Informatica, 2016

Improved initial vertex ordering for exact maximum clique search.
Appl. Intell., 2016

A Branch and Bound Algorithm for a Fractional 0-1 Programming Problem.
Proceedings of the Discrete Optimization and Operations Research, 2016

2015
Infra-chromatic bound for exact maximum clique search.
Comput. Oper. Res., 2015

Heuristic for Site-Dependent Truck and Trailer Routing Problem with Soft and Hard Time Windows and Split Deliveries.
Proceedings of the Machine Learning, Optimization, and Big Data, 2015

Reusing the Same Coloring in the Child Nodes of the Search Tree for the Maximum Clique Problem.
Proceedings of the Learning and Intelligent Optimization - 9th International Conference, 2015

2014
Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time.
Optim. Methods Softw., 2014

Exact model for the cell formation problem.
Optim. Lett., 2014

Speeding up branch and bound algorithms for solving the maximum clique problem.
J. Glob. Optim., 2014

Improvements to MCS algorithm for the maximum clique problem.
J. Comb. Optim., 2014

Initial Sorting of Vertices in the Maximum Clique Problem Reviewed.
Proceedings of the Learning and Intelligent Optimization, 2014

A Dynamic Programming Heuristic for Optimizing Slot Sizes in a Warehouse.
Proceedings of the Second International Conference on Information Technology and Quantitative Management, 2014

Heuristic for a Real-life Truck and Trailer Routing Problem.
Proceedings of the Second International Conference on Information Technology and Quantitative Management, 2014


  Loading...