Остановите войну!
for scientists:
default search action
Mikhail Y. Kovalyov
- > Home > Persons > Mikhail Y. Kovalyov
Publications
- 2023
- [j116]Jan-Erik Justkowiak, Sergey Kovalev, Mikhail Y. Kovalyov, Erwin Pesch:
Single machine scheduling with assignable due dates to minimize maximum and total late work. Eur. J. Oper. Res. 308(1): 76-83 (2023) - [j115]Mikhail Y. Kovalyov, Mikhail N. Lukashevich, Erwin Pesch:
Cost minimizing planning of container inspection and repair in multiple facilities. OR Spectr. 45(1): 181-204 (2023) - 2021
- [j108]Mikhail Y. Kovalyov, Erwin Pesch, Alain Quilliot:
Provision-after-wait with preferences ordered by difference: Tighter complexity and better approximation. Eur. J. Oper. Res. 289(3): 1008-1012 (2021) - [j107]Andrei M. Bandalouski, Natalja G. Egorova, Mikhail Y. Kovalyov, Erwin Pesch, S. Armagan Tarim:
Dynamic pricing with demand disaggregation for hotel revenue management. J. Heuristics 27(5): 869-885 (2021) - [j105]Ilia Fridman, Mikhail Y. Kovalyov, Erwin Pesch, Andrew Ryzhikov:
Fixed interval scheduling with third-party machines. Networks 77(3): 361-371 (2021) - 2019
- [j101]Mikhail Y. Kovalyov, Dominik Kress, Sebastian Meiswinkel, Erwin Pesch:
A parallel machine schedule updating game with compensations and clients averse to uncertain loss. Comput. Oper. Res. 103: 148-157 (2019) - 2018
- [j93]Mikhail Y. Kovalyov, Erwin Pesch, Andrew Ryzhikov:
A note on scheduling container storage operations of two non-passing stacking cranes. Networks 71(3): 271-280 (2018) - [j92]Andrei M. Bandalouski, Mikhail Y. Kovalyov, Erwin Pesch, S. Armagan Tarim:
An overview of revenue management and dynamic pricing models in hotel business. RAIRO Oper. Res. 52(1): 119-141 (2018) - 2016
- [j86]Adam Janiak, Wladyslaw A. Janiak, Mikhail Y. Kovalyov, Erhan Kozan, Erwin Pesch:
Corrigendum to 'Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs' [Information Sciences, 224 (2013) 109-117]. Inf. Sci. 357: 217 (2016) - [c5]Erwin Pesch, Mikhail Y. Kovalyov, Dominik Kress, Sebastian Meiswinkel:
Decentralized sequencing of jobs on a single machine. SSCI 2016: 1-7 - 2013
- [j76]Adam Janiak, Wladyslaw A. Janiak, Mikhail Y. Kovalyov, Erhan Kozan, Erwin Pesch:
Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs. Inf. Sci. 224: 109-117 (2013) - [c4]Alexandre Dolgui, Sergey Kovalev, Mikhail Y. Kovalyov, Jenny Nossack, Erwin Pesch:
A Transfer Line Design Problem with Setup Times and Costs. MIM 2013: 778-783 - 2010
- [j62]Mikhail Y. Kovalyov, Erwin Pesch:
A generic approach to proving NP-hardness of partition type problems. Discret. Appl. Math. 158(17): 1908-1912 (2010) - 2008
- [j53]Sergei Chubanov, Mikhail Y. Kovalyov, Erwin Pesch:
A single-item economic lot-sizing problem with a non-uniform resource: Approximation. Eur. J. Oper. Res. 189(3): 877-889 (2008) - 2006
- [j36]Sergei Chubanov, Mikhail Y. Kovalyov, Erwin Pesch:
An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure. Math. Program. 106(3): 453-466 (2006)
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 2023-10-05 23:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint