|
1
|
Кононов А.В.
, Севастьянов С.В.
, Черных И.Д.
Точный полиномиальный алгоритм для задачи Джонсона с маршрутизацией на ассиметрической сети.
Математика в Академгородке
02-04 дек. 2024
|
|
2
|
Sevastyanov S.
On the uselessness of Supercomputers for solving discrete optimization problems by means of some “theoretically efficient” algorithms
XXIII International Conference Mathematical Optimization Theory and Operations Research
30 Jun - 6 Jul 2024
|
|
3
|
Sevastyanov S.V.
THREE EFFICIENT METHODS OF FINDING NEAR-OPTIMAL SOLUTION FOR NP-HARD DISCRETE OPTIMIZATION PROBLEMS. (ILLUSTRATED BY THEIR APPLICATION TO SCHEDULING PROBLEMS)
International Conference Mathematical Optimization Theory and Operations Research Petrozavodsk, Karelia, Russia, July 2-6, 2022
02-08 Jul 2022
|
|
4
|
Sevastyanov S.V.
“Nearly all” instances of an NP-hard scheduling problem appear to be easily solvable. Is that a unique case in scheduling?
Танаевские чтения 2021
30-30 Mar 2021
|
|
5
|
Chernykh I.
, Sevastyanov S.
Optima Localization for Scheduling Problems: Computer-aided Approach
Танаевские чтения 2021
30-30 Mar 2021
|
|
6
|
Chernykh I.
, Kononov A.
, Sevastyanov S.
A polynomial-time algorithm for the routing flow shop problem with two machines: an asymmetric network with a fixed number of nodes
Mathematical Optimization Theory and Operations Research
06-10 Jul 2020
|
|
7
|
Chernykh I.
, Kononov A.
, Sevastyanov S.
On the complexity of the two-machine routing flow shop
14th Workshop on Models and Algorithms for Planning and Scheduling Problems
02-07 Jun 2019
|
|
8
|
Chernykh I.
, Kononov A.
, Sevastyanov S.
Exact polynomial-time algorithm for the two-machine routing flow shop with a restricted transportation network
Проблемы оптимизации и их приложения Optimization Problems and Their Applications
08-14 Jul 2018
|
|
9
|
Chernykh I.
, Sevastyanov S.
On the abnormality in open shops
17th Baikal international school-seminar “Methods of Optimization and Their Applications”.
31 июл. - 6 авг. 2017
|