A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work. - Mikhail Y. Kovalyov; Chris N. Potts; Luk N. Van Wassenhove (Math. Oper. Res., 1994)

Single machine group scheduling with ordered criteria. - Adam Janiak; Mikhail Y. Kovalyov (Ann. Oper. Res., 1995)

Single machine batch scheduling with deadlines and resource dependent processing times. - T. C. Edwin Cheng; Mikhail Y. Kovalyov (Oper. Res. Lett., 1995)

Improving the complexities of approximation algorithms for optimization problems. - Mikhail Y. Kovalyov (Oper. Res. Lett., 1995)

Batch Scheduling and Common Due-date Assignment on a Single Machine. - T. C. Edwin Cheng; Mikhail Y. Kovalyov (Discret. Appl. Math., 1996)

Single machine batch scheduling to minimize the weighted number of late jobs. - Peter Brucker; Mikhail Y. Kovalyov (Math. Methods Oper. Res., 1996)

Batch Scheduling and Common Due Date Assignment Problem: an NP-hard Case. - Mikhail Y. Kovalyov (Discret. Appl. Math., 1997)

Batch Scheduling with Deadlines on Parallel Machines: An NP-Hard Case. - Mikhail Y. Kovalyov; Yakov M. Shafransky (Inf. Process. Lett., 1997)

A polynomial approximation scheme for problem F2/rj/Cmax. - Mikhail Y. Kovalyov; Frank Werner 001 (Oper. Res. Lett., 1997)

Single Machine Scheduling to Minimize Batch Delivery and Job Earliness Penalties. - T. C. Edwin Cheng; Mikhail Y. Kovalyov; Bertrand M. T. Lin (SIAM J. Optim., 1997)

Batch scheduling with deadlines on parallel machines. - Peter Brucker; Mikhail Y. Kovalyov; Yakov M. Shafransky; Frank Werner 001 (Ann. Oper. Res., 1998)

Uniform Machine Scheduling of Unit-time Jobs Subject to Resource Constraints. - Mikhail Y. Kovalyov; Yakov M. Shafransky (Discret. Appl. Math., 1998)

A Fully Polynomial Approximation Scheme for Minimizing Makespan of Deteriorating Jobs. - Mikhail Y. Kovalyov; Wieslaw Kubiak (J. Heuristics, 1998)

Bicriterion Single Machine Scheduling with Resource Dependent Processing Times. - T. C. Edwin Cheng; Adam Janiak; Mikhail Y. Kovalyov (SIAM J. Optim., 1998)

Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness. - T. C. Edwin Cheng; Mikhail Y. Kovalyov (Eur. J. Oper. Res., 1999)

A Fully Polynomial Approximation Scheme for the Weighted Earliness-Tardiness Problem. - Mikhail Y. Kovalyov; Wieslaw Kubiak (Oper. Res., 1999)

Scheduling with batching: A review. - Chris N. Potts; Mikhail Y. Kovalyov (Eur. J. Oper. Res., 2000)

Single Supplier Scheduling for Multiple Deliveries. - T. C. Edwin Cheng; Mikhail Y. Kovalyov (Ann. Oper. Res., 2001)

Single machine batch scheduling with resource dependent setup and processing times. - T. C. Edwin Cheng; Adam Janiak; Mikhail Y. Kovalyov (Eur. J. Oper. Res., 2001)

Single Machine Scheduling Problems with Exponentially Start Time Dependent Job Processing Times. - Aleksander Bachman; Adam Janiak; Mikhail Y. Kovalyov (OR, 2002)

An unconstrained optimization problem is NP-hard given an oracle representation of its objective function: a technical note. - T. C. Edwin Cheng; Mikhail Y. Kovalyov (Comput. Oper. Res., 2002)

Fast fully polynomial approximation schemes for minimizing completion time variance. - Wieslaw Kubiak; Jinliang Cheng; Mikhail Y. Kovalyov (Eur. J. Oper. Res., 2002)

Approximation Schemes for Scheduling Jobs with Common Due Date on Parallel Machines to Minimize Total Tardiness. - Mikhail Y. Kovalyov; Frank Werner 001 (J. Heuristics, 2002)

Minimizing the total weighted completion time of deteriorating jobs. - Aleksander Bachman; Adam Janiak; Mikhail Y. Kovalyov (Inf. Process. Lett., 2002)

A polynomial algorithm for lot-size scheduling of two type tasks. - Mikhail Y. Kovalyov; Marcus Pattloch; Günter Schmidt 002 (Inf. Process. Lett., 2002)

Scheduling a Single Server in a Two-machine Flow Shop. - T. C. Edwin Cheng; Mikhail Y. Kovalyov (Computing, 2003)

Single machine scheduling with a variable common due date and resource-dependent processing times. - C. T. Daniel Ng; T. C. Edwin Cheng; Mikhail Y. Kovalyov; Sze Sing Lam (Comput. Oper. Res., 2003)

Batch scheduling with controllable setup and processing times to minimize total completion time. - C. T. Daniel Ng; T. C. E. Cheng; Mikhail Y. Kovalyov (J. Oper. Res. Soc., 2003)

Maximization Problems in Single Machine Scheduling. - Mohamed Ali Aloulou; Mikhail Y. Kovalyov; Marie-Claude Portmann (Ann. Oper. Res., 2004)

Scheduling Malleable Tasks on Parallel Processors to Minimize the Makespan. - Jacek Blazewicz; Maciej Machowiak; Jan Weglarz; Mikhail Y. Kovalyov; Denis Trystram (Ann. Oper. Res., 2004)

Batching decisions for assembly production systems. - Mikhail Y. Kovalyov; Chris N. Potts; Vitaly A. Strusevich (Eur. J. Oper. Res., 2004)

Single machine batch scheduling with jointly compressible setup and processing times. - C. T. Daniel Ng; T. C. Edwin Cheng; Mikhail Y. Kovalyov (Eur. J. Oper. Res., 2004)

Group Scheduling with Controllable Setup and Processing Times: Minimizing Total Weighted Completion Time. - C. T. Ng 001; T. C. Edwin Cheng; Adam Janiak; Mikhail Y. Kovalyov (Ann. Oper. Res., 2005)

Positive half-products and scheduling with controllable processing times. - Adam Janiak; Mikhail Y. Kovalyov; Wieslaw Kubiak; Frank Werner 001 (Eur. J. Oper. Res., 2005)

Single machine group scheduling with resource dependent setup and processing times. - Adam Janiak; Mikhail Y. Kovalyov; Marie-Claude Portmann (Eur. J. Oper. Res., 2005)

Batching work and rework processes with limited deterioration of reworkables. - Karl Inderfurth; Adam Janiak; Mikhail Y. Kovalyov; Frank Werner 001 (Comput. Oper. Res., 2006)

Scheduling with controllable release dates and processing times: Makespan minimization. - T. C. Edwin Cheng; Mikhail Y. Kovalyov; Natalia V. Shakhlevich (Eur. J. Oper. Res., 2006)

Scheduling with controllable release dates and processing times: Total completion time minimization. - T. C. Edwin Cheng; Mikhail Y. Kovalyov; Natalia V. Shakhlevich (Eur. J. Oper. Res., 2006)

Scheduling in a contaminated area: A model and polynomial algorithms. - Adam Janiak; Mikhail Y. Kovalyov (Eur. J. Oper. Res., 2006)

Job Sequencing with Exponential Functions of Processing Times. - Adam Janiak; Mikhail Y. Kovalyov (Informatica, 2006)

Optimal testing and repairing a failed series system. - Mikhail Y. Kovalyov; Marie-Claude Portmann; Ammar Oulamara (J. Comb. Optim., 2006)

An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure. - Sergei Chubanov; Mikhail Y. Kovalyov; Erwin Pesch (Math. Program., 2006)

Preemptable Malleable Task Scheduling Problem. - Jacek Blazewicz; Mikhail Y. Kovalyov; Maciej Machowiak; Denis Trystram; Jan Weglarz (IEEE Trans. Computers, 2006)

Batching deteriorating items with applications in computer communication and reverse logistics. - Fawaz S. Al-Anzi; Ali Allahverdi; Mikhail Y. Kovalyov (Eur. J. Oper. Res., 2007)

Fixed interval scheduling: Models, applications, computational complexity and algorithms. - Mikhail Y. Kovalyov; C. T. Ng 001; T. C. Edwin Cheng (Eur. J. Oper. Res., 2007)

Problem F2∥Cmax with forbidden jobs in the first or last position is easy. - Mikhail Y. Kovalyov; Frank Werner 001 (Eur. J. Oper. Res., 2007)

Evaluating flexible solutions in single machine scheduling via objective function maximization: the study of computational complexity. - Mohamed Ali Aloulou; Mikhail Y. Kovalyov; Marie-Claude Portmann (RAIRO Oper. Res., 2007)

Batching and scheduling in a multi-machine flow shop. - C. T. Ng 001; Mikhail Y. Kovalyov (J. Sched., 2007)

Simplified Partial Digest Problem: Enumerative and Dynamic Programming Algorithms. - Jacek Blazewicz; Edmund K. Burke; Marta Kasprzak; Alexandr Kovalev; Mikhail Y. Kovalyov (IEEE ACM Trans. Comput. Biol. Bioinform., 2007)

Soft Due Window Assignment and Scheduling on Parallel Machines. - Adam Janiak; Mikhail Y. Kovalyov; Marcin Marek (IEEE Trans. Syst. Man Cybern. Part A, 2007)

Lot-Sizing and Sequencing on a Single Imperfect Machine. - Alexandre Dolgui; Mikhail Y. Kovalyov; Kseniya Shchamialiova (MCO, 2008)

Group sequencing around a common due date. - T. C. Edwin Cheng; Mikhail Y. Kovalyov; C. T. Ng 001; Sze Sing Lam (Discret. Optim., 2008)

A survey of scheduling problems with setup times or costs. - Ali Allahverdi; C. T. Ng 001; T. C. Edwin Cheng; Mikhail Y. Kovalyov (Eur. J. Oper. Res., 2008)

Batch scheduling of deteriorating reworkables. - M. S. Barketau; T. C. Edwin Cheng; Mikhail Y. Kovalyov (Eur. J. Oper. Res., 2008)

A single-item economic lot-sizing problem with a non-uniform resource: Approximation. - Sergei Chubanov; Mikhail Y. Kovalyov; Erwin Pesch (Eur. J. Oper. Res., 2008)

Combinatorics for modern manufacturing, logistics and supply chains (ECCO XVIII). - Mikhail Y. Kovalyov; Silvano Martello (Eur. J. Oper. Res., 2008)

Scheduling jobs in a contaminated area: a model and heuristic algorithms. - Adam Janiak; Mikhail Y. Kovalyov (J. Oper. Res. Soc., 2008)

Batch scheduling of step deteriorating jobs. - M. S. Barketau; T. C. Edwin Cheng; C. T. Ng 001; Vladimir Kotov; Mikhail Y. Kovalyov (J. Sched., 2008)

On the approximability of the Simplified Partial Digest Problem. - Jacek Blazewicz; Edmund K. Burke; Marta Kasprzak; Alexandr Kovalev; Mikhail Y. Kovalyov (Discret. Appl. Math., 2009)

The EOQ problem with decidable warehouse capacity: Analysis, solution approaches and applications. - C. T. Ng 001; T. C. Edwin Cheng; Vladimir Kotov; Mikhail Y. Kovalyov (Discret. Appl. Math., 2009)

Internet shopping optimization problem. - Jacek Blazewicz; Mikhail Y. Kovalyov; Jedrzej Musial; Andrzej P. Urbanski; Adam Wojciechowski (Int. J. Appl. Math. Comput. Sci., 2010)

A generic approach to proving NP-hardness of partition type problems. - Mikhail Y. Kovalyov; Erwin Pesch (Discret. Appl. Math., 2010)

Minimizing total completion time on a batching machine with job processing time compatibilities. - Adrien Bellanger; Ammar Oulamara; Mikhail Y. Kovalyov (Electron. Notes Discret. Math., 2010)

"Product Partition" and related problems of scheduling and systems reliability: Computational complexity and approximation. - C. T. Ng 001; M. S. Barketau; T. C. Edwin Cheng; Mikhail Y. Kovalyov (Eur. J. Oper. Res., 2010)

A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure. - C. T. Ng 001; Mikhail Y. Kovalyov; T. C. E. Cheng (Eur. J. Oper. Res., 2010)

Multi-product lot-sizing and sequencing on a single imperfect machine. - Alexandre Dolgui; Mikhail Y. Kovalyov; Kseniya Shchamialiova (Comput. Optim. Appl., 2011)

The simplified partial digest problem: Approximation and a graph-theoretic model. - Jacek Blazewicz; Edmund K. Burke; Marta Kasprzak; Alexandr Kovalev; Mikhail Y. Kovalyov (Eur. J. Oper. Res., 2011)

Minimizing the number of late jobs on a single machine under due date uncertainty. - Hassene Aissi; Mohamed Ali Aloulou; Mikhail Y. Kovalyov (J. Sched., 2011)

Two-Agent Scheduling on an Unbounded Serial Batching Machine. - Mikhail Y. Kovalyov; Ammar Oulamara; Ameur Soukhal (ISCO, 2012)

Soft due window assignment and scheduling of unit-time jobs on parallel machines. - Adam Janiak; Wladyslaw A. Janiak; Mikhail Y. Kovalyov; Frank Werner 001 (4OR, 2012)

Scheduling an unbounded batching machine with job processing time compatibilities. - Adrien Bellanger; Adam Janiak; Mikhail Y. Kovalyov; Ammar Oulamara (Discret. Appl. Math., 2012)

Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence. - F. J. Hwang; Mikhail Y. Kovalyov; Bertrand M. T. Lin (Discret. Optim., 2012)

Scheduling jobs with position-dependent processing times. - Adam Janiak; Mikhail Y. Kovalyov (J. Oper. Res. Soc., 2012)

Editorial: new branches, old roots. - Jacek Blazewicz; Edmund K. Burke; Valery S. Gordon; Mikhail Y. Kovalyov; Yakov M. Shafransky; Vitaly A. Strusevich (J. Sched., 2012)

Vyacheslav Tanaev: contributions to scheduling and related areas. - Valery S. Gordon; Mikhail Y. Kovalyov; G. M. Levin; Yakov M. Shafransky; Yuri N. Sotskov; Vitaly A. Strusevich; Alexander V. Tuzikov (J. Sched., 2012)

A Transfer Line Design Problem with Setup Times and Costs. - Alexandre Dolgui; Sergey Kovalev; Mikhail Y. Kovalyov; Jenny Nossack; Erwin Pesch (MIM, 2013)

Strong NP-hardness of scheduling problems with learning or aging effect. - Adam Janiak; Mikhail Y. Kovalyov; Maciej Lichtenstein (Ann. Oper. Res., 2013)

Lot-sizing on a single imperfect machine: ILP models and FPTAS extensions. - Kseniya Schemeleva; Xavier Delorme; Alexandre Dolgui; Frédéric Grimaud; Mikhail Y. Kovalyov (Comput. Ind. Eng., 2013)

Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs. - Adam Janiak; Wladyslaw A. Janiak; Mikhail Y. Kovalyov; Erhan Kozan; Erwin Pesch (Inf. Sci., 2013)

Complexity of Buffer Capacity Allocation Problems for Production Lines with Unreliable Machines. - Alexandre Dolgui; Anton V. Eremeev; Mikhail Y. Kovalyov; Viatcheslav S. Sigaev (J. Math. Model. Algorithms Oper. Res., 2013)

Comment on 'the strong NP-completeness of 3-PARTITION problem with Bkm' by Zhongyi Jiang, Fangfang Chen, Chunqing Wu. - Adam Janiak; Maciej Lichtenstein; Mikhail Y. Kovalyov (J. Oper. Res. Soc., 2013)

Letter to the Editor. - Adam Janiak; Mikhail Y. Kovalyov (Optim. Lett., 2013)

Internet shopping with price sensitive discounts. - Jacek Blazewicz; Pascal Bouvry; Mikhail Y. Kovalyov; Jedrzej Musial (4OR, 2014)

Erratum to: Internet shopping with price-sensitive discounts. - Jacek Blazewicz; Pascal Bouvry; Mikhail Y. Kovalyov; Jedrzej Musial (4OR, 2014)

Scientific school of Academician V. S. Tanaev: Results on the scheduling theory. - Mikhail Y. Kovalyov; Yuri N. Sotskov; Yakov M. Shafransky (Autom. Remote. Control., 2014)

Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence. - F. J. Hwang; Mikhail Y. Kovalyov; Bertrand M. T. Lin (Ann. Oper. Res., 2014)

A graph-theoretic approach to interval scheduling on dedicated unrelated parallel machines. - Chi To Ng 001; Tai Chiu Edwin Cheng; Andrei M. Bandalouski; Mikhail Y. Kovalyov; Sze Sing Lam (J. Oper. Res. Soc., 2014)

Two faster algorithms for coordination of production and batch delivery: A note. - Alessandro Agnetis; Mohamed Ali Aloulou; Liang-Liang Fu; Mikhail Y. Kovalyov (Eur. J. Oper. Res., 2015)

Two-agent scheduling with agent specific batches on an unbounded serial batching machine. - Mikhail Y. Kovalyov; Ammar Oulamara; Ameur Soukhal (J. Sched., 2015)

Decentralized sequencing of jobs on a single machine. - Erwin Pesch; Mikhail Y. Kovalyov; Dominik Kress; Sebastian Meiswinkel (SSCI, 2016)

Bi-criteria sequencing of courses and formation of classes for a bottleneck classroom. - Oliver G. Czibula; Hanyu Gu; Feng-Jang Hwang; Mikhail Y. Kovalyov; Yakov Zinder (Comput. Oper. Res., 2016)

Corrigendum to 'Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs' [Information Sciences, 224 (2013) 109-117]. - Adam Janiak; Wladyslaw A. Janiak; Mikhail Y. Kovalyov; Erhan Kozan; Erwin Pesch (Inf. Sci., 2016)

Graphs with maximal induced matchings of the same size. - Philippe Baptiste; Mikhail Y. Kovalyov; Yury L. Orlovich; Frank Werner 001; Igor E. Zverovich (Discret. Appl. Math., 2017)

Integrated production scheduling and batch delivery with fixed departure times and inventory holding costs. - Alessandro Agnetis; Mohamed Ali Aloulou; Mikhail Y. Kovalyov (Int. J. Prod. Res., 2017)

Knapsack problem with objective value gaps. - Alexandre Dolgui; Mikhail Y. Kovalyov; Alain Quilliot (Optim. Lett., 2017)

Corrigendum to "An FPTAS for the parallel two-stage flowshop problem" [Theoret. Comput. Sci. 657 (2017) 64-72]. - Jianming Dong; Jueliang Hu; Mikhail Y. Kovalyov; Guohui Lin; Taibo Luo; Weitian Tong; Xueshi Wang; Yinfeng Xu (Theor. Comput. Sci., 2017)

Optimal workforce assignment to operations of a paced assembly line. - Alexandre Dolgui; Sergey Kovalev; Mikhail Y. Kovalyov; Sergey Malyutin; Ameur Soukhal (Eur. J. Oper. Res., 2018)

A note on scheduling container storage operations of two non-passing stacking cranes. - Mikhail Y. Kovalyov; Erwin Pesch; Andrew Ryzhikov (Networks, 2018)

An overview of revenue management and dynamic pricing models in hotel business. - Andrei M. Bandalouski; Mikhail Y. Kovalyov; Erwin Pesch; S. Armagan Tarim (RAIRO Oper. Res., 2018)

No-idle Parallel Machine Scheduling of Unit-time Jobs. - Nadia Brauner; Mikhail Y. Kovalyov; Alain Quilliot; Hélène Toussaint (CoDIT, 2019)

Maximum Diversity Problem with Squared Euclidean Distance. - Anton V. Eremeev; Alexander V. Kel'manov; Mikhail Y. Kovalyov; Artem V. Pyatkin (MOTOR, 2019)

A parallel machine schedule updating game with compensations and clients averse to uncertain loss. - Mikhail Y. Kovalyov; Dominik Kress; Sebastian Meiswinkel; Erwin Pesch (Comput. Oper. Res., 2019)

Minimizing the number of workers in a paced mixed-model assembly line. - Xavier Delorme; Alexandre Dolgui; Sergey Kovalev; Mikhail Y. Kovalyov (Eur. J. Oper. Res., 2019)

Semi-V-shape property for two-machine no-wait proportionate flow shop problem with TADC criterion. - Sergey Kovalev; Mikhail Y. Kovalyov; Gur Mosheiov; Enrique Gerstl (Int. J. Prod. Res., 2019)

Comments on "Proportionate flowshops with general position dependent processing times" [Inf. Process. Lett. 111 and "Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection" [Inf. Process. Lett. 132 (2018) 39-43]. - Mikhail Y. Kovalyov; Gur Mosheiov; Dmitrij Sesok (Inf. Process. Lett., 2019)

Bi-criteria path problem with minimum length and maximum survival probability. - Nir Halman; Mikhail Y. Kovalyov; Alain Quilliot; Dvir Shabtay; Moshe Zofi (OR Spectr., 2019)

Two-agent scheduling with deteriorating jobs on a single parallel-batching machine: refining computational complexity. - Mikhail Y. Kovalyov; Dmitrij Sesok (J. Sched., 2019)

Minimizing machine assignment costs over Δ-approximate solutions of the scheduling problem P||Cmax. - Alexander V. Kononov; Mikhail Y. Kovalyov; Bertrand M. T. Lin (Theor. Comput. Sci., 2019)

On Finding Minimum Cardinality Subset of Vectors with a Constraint on the Sum of Squared Euclidean Pairwise Distances. - Anton V. Eremeev; Mikhail Y. Kovalyov; Artem V. Pyatkin (LION, 2020)

Mathematical Model and Random Search Algorithm for the Optimal Planning Problem of Replacing Traditional Public Transport with Electric. - Mikhail Y. Kovalyov; Boris Rozin; N. N. Guschinsky (Autom. Remote. Control., 2020)

Three parallel task assignment problems with shared resources. - Ali Diabat; Alexandre Dolgui; Wladyslaw A. Janiak; Mikhail Y. Kovalyov (IISE Trans., 2020)

Lot-size scheduling of a single product on unrelated parallel machines. - Anton V. Eremeev; Mikhail Y. Kovalyov; Pavel M. Kuznetsov (Optim. Lett., 2020)

Min-max controllable risk problems. - Evgeny Gurevsky 001; Sergey Kovalev; Mikhail Y. Kovalyov (4OR, 2021)

No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines. - Nadia Brauner; Mikhail Y. Kovalyov; Alain Quilliot; Hélène Toussaint (Comput. Oper. Res., 2021)

Fleet and charging infrastructure decisions for fast-charging city electric bus service. - Nikolai Guschinsky; Mikhail Y. Kovalyov; Boris Rozin; Nadia Brauner (Comput. Oper. Res., 2021)

Provision-after-wait with preferences ordered by difference: Tighter complexity and better approximation. - Mikhail Y. Kovalyov; Erwin Pesch; Alain Quilliot (Eur. J. Oper. Res., 2021)

Dynamic pricing with demand disaggregation for hotel revenue management. - Andrei M. Bandalouski; Natalja G. Egorova; Mikhail Y. Kovalyov; Erwin Pesch; S. Armagan Tarim (J. Heuristics, 2021)

Workforce reconfiguration strategies in manufacturing systems: a state of the art. - S. Ehsan Hashemi-Petroodi; Alexandre Dolgui; Sergey Kovalev; Mikhail Y. Kovalyov; Simon Thevenin (Int. J. Prod. Res., 2021)

Fixed interval scheduling with third-party machines. - Ilia Fridman; Mikhail Y. Kovalyov; Erwin Pesch; Andrew Ryzhikov (Networks, 2021)

Selecting a subset of diverse points based on the squared euclidean distance. - Anton V. Eremeev; Alexander V. Kel'manov; Mikhail Y. Kovalyov; Artem V. Pyatkin (Ann. Math. Artif. Intell., 2022)

Alternative algorithms for identical machines scheduling to maximize total early work with a common due date. - Xin Chen 057; Xuefeng Shen; Mikhail Y. Kovalyov; Malgorzata Sterna; Jacek Blazewicz (Comput. Ind. Eng., 2022)

Min-sum controllable risk problems with concave risk functions of the same value range. - Evgeny Gurevsky 001; Dmitry Kopelevich; Sergey Kovalev; Mikhail Y. Kovalyov (Networks, 2022)

Cost minimizing planning of container inspection and repair in multiple facilities. - Mikhail Y. Kovalyov; Mikhail N. Lukashevich; Erwin Pesch (OR Spectr., 2023)

Max-max, max-min, min-max and min-min knapsack problems with a parametric constraint. - Nir Halman; Mikhail Y. Kovalyov; Alain Quilliot (4OR, 2023)

Single machine scheduling with assignable due dates to minimize maximum and total late work. - Jan-Erik Justkowiak; Sergey Kovalev; Mikhail Y. Kovalyov; Erwin Pesch (Eur. J. Oper. Res., 2023)

Integer knapsack problems with profit functions of the same value range. - Evgeny Gurevsky 001; Dmitry Kopelevich; Sergey Kovalev; Mikhail Y. Kovalyov (4OR, 2023)

Planning container inspection and repair: A case study. - Mikhail Y. Kovalyov; Katarzyna Anna Kuzmicz; Mikhail N. Lukashevich; Erwin Pesch (Comput. Oper. Res., 2024)

A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty. - Nadia Brauner; Evgeny Gurevsky 001; Mikhail Y. Kovalyov (Discret. Appl. Math., 2024)

A dynamic programming algorithm for order picking in robotic mobile fulfillment systems. - Jan-Erik Justkowiak; Mikhail Y. Kovalyov; Erwin Pesch (Networks, 2024)

Scheduling electric vehicle regular charging tasks: A review of deterministic models. - Alexandre Dolgui; Sergey Kovalev; Mikhail Y. Kovalyov (Eur. J. Oper. Res., 2025)

Supermarket-chain grocery delivery optimization through crowdshipping. - F. J. Hwang; Bohan Hu; Mikhail Y. Kovalyov (Int. J. Prod. Res., 2025)

An improved FPTAS for budgeted laminar matroid independent set. - Yang Yang; Mikhail Y. Kovalyov; Yong Zhang (Oper. Res. Lett., 2025)