![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Mikhail Batsyn
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j14]Mikhail V. Batsyn
, Ekaterina K. Batsyna, Ilya S. Bychkov, Panos M. Pardalos:
Vehicle assignment in site-dependent vehicle routing problems with split deliveries. Oper. Res. 21(1): 399-423 (2021) - 2020
- [j13]Mikhail V. Batsyn
, Ekaterina K. Batsyna
, Ilya S. Bychkov
:
NP-completeness of cell formation problem with grouping efficacy objective. Int. J. Prod. Res. 58(20): 6159-6169 (2020)
2010 – 2019
- 2019
- [i5]Mikhail V. Batsyn, Ekaterina K. Batsyna, Ilya S. Bychkov:
On NP-completeness of the cell formation problem. CoRR abs/1901.02778 (2019) - 2018
- [j12]Ilya Bychkov, Mikhail Batsyn:
An efficient exact model for the cell formation problem with a variable number of production cells. Comput. Oper. Res. 91: 112-120 (2018) - [j11]Irina Utkina, Mikhail V. Batsyn
, Ekaterina K. Batsyna:
A branch-and-bound algorithm for the cell formation problem. Int. J. Prod. Res. 56(9): 3262-3273 (2018) - [c7]Alexey Nikolaev, Mikhail Batsyn:
Branch-and-Bound Algorithm for Symmetric Travelling Salesman Problem. IWOCA 2018: 311-322 - 2017
- [j10]Pablo San Segundo
, Alvaro Lopez, Mikhail Batsyn, Alexey Nikolaev, Panos M. Pardalos:
Erratum to: Improved initial vertex ordering for exact maximum clique search. Appl. Intell. 46(1): 240 (2017) - [j9]Pablo San Segundo
, Jorge Artieda, Mikhail Batsyn, Panos M. Pardalos:
An enhanced bitstring encoding for exact maximum clique search in sparse graphs. Optim. Methods Softw. 32(2): 312-335 (2017) - [i4]Ilya Bychkov, Mikhail Batsyn:
An efficient exact model for the cell formation problem with a variable number of production cells. CoRR abs/1701.02472 (2017) - [i3]Ilya Bychkov, Mikhail Batsyn, Panos M. Pardalos:
Heuristic for Maximizing Grouping Efficiency in the Cell Formation Problem. CoRR abs/1702.07266 (2017) - [i2]Alexander Ponomarenko, Irina Utkina, Mikhail Batsyn:
A Model of Optimal Network Structure for Decentralized Nearest Neighbor Search. CoRR abs/1712.08437 (2017) - 2016
- [j8]Pablo San Segundo
, Alvaro Lopez, Mikhail Batsyn, Alexey Nikolaev
, Panos M. Pardalos:
Improved initial vertex ordering for exact maximum clique search. Appl. Intell. 45(3): 868-880 (2016) - [j7]Pablo San Segundo, Alexey Nikolaev, Mikhail Batsyn, Panos M. Pardalos:
Improved Infra-Chromatic Bound for Exact Maximum Clique Search. Informatica 27(2): 463-487 (2016) - [j6]Larisa Komosko, Mikhail Batsyn
, Pablo San Segundo
, Panos M. Pardalos:
A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations. J. Comb. Optim. 31(4): 1665-1677 (2016) - [c6]Irina Utkina, Mikhail Batsyn, Ekaterina Batsyna:
A Branch and Bound Algorithm for a Fractional 0-1 Programming Problem. DOOR 2016: 244-255 - [i1]Irina Utkina, Mikhail Batsyn, Ekaterina Batsyna:
A branch and bound algorithm for a fractional 0-1 programming problem. CoRR abs/1603.04597 (2016) - 2015
- [j5]Pablo San Segundo
, Alexey Nikolaev
, Mikhail Batsyn
:
Infra-chromatic bound for exact maximum clique search. Comput. Oper. Res. 64: 293-303 (2015) - [c5]Alexey Nikolaev
, Mikhail Batsyn, Pablo San Segundo
:
Reusing the Same Coloring in the Child Nodes of the Search Tree for the Maximum Clique Problem. LION 2015: 275-280 - [c4]Mikhail Batsyn, Alexander Ponomarenko:
Heuristic for Site-Dependent Truck and Trailer Routing Problem with Soft and Hard Time Windows and Split Deliveries. MOD 2015: 65-79 - 2014
- [j4]Mikhail Batsyn
, Boris Goldengorin
, Evgeny Maslov, Panos M. Pardalos:
Improvements to MCS algorithm for the maximum clique problem. J. Comb. Optim. 27(2): 397-416 (2014) - [j3]Evgeny Maslov, Mikhail Batsyn
, Panos M. Pardalos:
Speeding up branch and bound algorithms for solving the maximum clique problem. J. Glob. Optim. 59(1): 1-21 (2014) - [j2]Ilya Bychkov, Mikhail Batsyn
, Panos M. Pardalos:
Exact model for the cell formation problem. Optim. Lett. 8(8): 2203-2210 (2014) - [j1]Mikhail Batsyn
, Boris Goldengorin
, Panos M. Pardalos, Pavel Sukhov:
Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time. Optim. Methods Softw. 29(5): 955-963 (2014) - [c3]Pavel Sukhov, Mikhail Batsyn
, Petr Terentev:
A Dynamic Programming Heuristic for Optimizing Slot Sizes in a Warehouse. ITQM 2014: 773-777 - [c2]Mikhail Batsyn
, Alexander Ponomarenko
:
Heuristic for a Real-life Truck and Trailer Routing Problem. ITQM 2014: 778-792 - [c1]Pablo San Segundo
, Alvaro Lopez, Mikhail Batsyn
:
Initial Sorting of Vertices in the Maximum Clique Problem Reviewed. LION 2014: 111-120
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint