Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Tidjani Négadi
Manmohan Tripathi
Farhan Mahmood
Matthew Mitchell
Jhonathan Pinzon
Liangliang Shang
Giovanni Venturelli
Chen Ma
Jing-Sheng Wong
Radu Timofte
Home
/
Author
/
MIKHAIL BATSYN
Author Info
Open Visualization
Name
Affiliation
Papers
MIKHAIL BATSYN
Laboratory of Algorithms and Technologies for Networks Analysis, National Research University Higher School of Economics, Niznhy Novgorod, Russia
23
Collaborators
Citations
PageRank
23
86
10.02
Referers
Referees
References
141
257
214
Search Limit
100
257
Publications (23 rows)
Collaborators (23 rows)
Referers (100 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
Vehicle Assignment In Site-Dependent Vehicle Routing Problems With Split Deliveries
1
0.37
2021
Np-Completeness Of Cell Formation Problem With Grouping Efficacy Objective
0
0.34
2020
On NP-completeness of the cell formation problem.
0
0.34
2019
A Branch-And-Bound Algorithm For The Cell Formation Problem
0
0.34
2018
An efficient exact model for the cell formation problem with a variable number of production cells.
2
0.36
2018
A Model of Optimal Network Structure for Decentralized Nearest Neighbor Search.
0
0.34
2017
Erratum to: Improved initial vertex ordering for exact maximum clique search.
0
0.34
2017
Heuristic for Maximizing Grouping Efficiency in the Cell Formation Problem.
0
0.34
2017
An enhanced bitstring encoding for exact maximum clique search in sparse graphs.
2
0.36
2017
Improved Infra-Chromatic Bound For Exact Maximum Clique Search
1
0.35
2016
A Branch And Bound Algorithm For A Fractional 0-1 Programming Problem
2
0.40
2016
Improved initial vertex ordering for exact maximum clique search.
3
0.39
2016
A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations
2
0.39
2016
Infra-chromatic bound for exact maximum clique search
17
0.68
2015
Heuristic for Site-Dependent Truck and Trailer Routing Problem with Soft and Hard Time Windows and Split Deliveries.
2
0.52
2015
Reusing the Same Coloring in the Child Nodes of the Search Tree for the Maximum Clique Problem
3
0.38
2015
Initial Sorting of Vertices in the Maximum Clique Problem Reviewed.
5
0.45
2014
Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time
2
0.38
2014
A Dynamic Programming Heuristic for Optimizing Slot Sizes in a Warehouse.
0
0.34
2014
Speeding up branch and bound algorithms for solving the maximum clique problem
10
0.54
2014
Improvements to MCS algorithm for the maximum clique problem
25
1.00
2014
Exact model for the cell formation problem.
6
0.56
2014
Heuristic for a Real-life Truck and Trailer Routing Problem.
3
0.54
2014
1