1. Электронный научный архив УрФУ

Просмотр коллекции по группе - По тематике DYNAMIC PROGRAMMING

Перейти к: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
А Б В Г Д Е Ж З И Й К Л М Н О П Р С Т У Ф Х Ц Ч Ш Щ Ъ Ы Ь Э Ю Я
или введите несколько первых букв:  
Отображение результатов 15 до 34 из 44 < назад   дальше >
Дата публикацииНазваниеАвторы
2017On one routing problem modeling movement in radiation fieldsChentsov, A. G.; Chentsov, A. A.; Grigoryev, A. M.
2022ON ONE ROUTING PROBLEM ORIENTED ON THE PROBLEM OF DISMANTLING RADIATION-HAZARDOUS OBJECTS; [ОБ ОДНОЙ ЗАДАЧЕ МАРШРУТИЗАЦИИ, ОРИЕНТИРОВАННОЙ НА ПРОБЛЕМУ ДЕМОНТАЖА РАДИАЦИОННО ОПАСНЫХ ОБЪЕКТОВ]Chentsov, A. G.; Chentsov, A. A.
2020On one routing problem with non-additive cost aggregationChentsov, A. G.; Chentsov, A. A.; Sesekin, A. N.
2016On Parameterized Complexity of Hitting Set Problem for Axis–Parallel Squares Intersecting a Straight LineKhachay, D. M.; Khachay, M. Yu.
2020On Routing Problem with Starting Point OptimizationChentsov, Alexander G.; Chentsov, Pavel A.
2020On routing problem with starting point optimizationChentsov, A. G.; Chentsov, P. A.
2021On sequential traversal of setsChentsov, A. G.; Chentsov, P. A.
2023ON THE APPLICATION OF THE MINIMAX TRAVELING SALESMAN PROBLEM IN AVIATION LOGISTICSChentsov, A. G.; Chentsov, A. A.; Sesekin, A. N.
2021On the Problem of Sequential Traversal of Megalopolises with Precedence Conditions and Cost Functions Depending on a List of TasksChentsov, A. G.; Chentsov, A. A.; Sesekin, A. N.
2020On the Problem of Sequential Traversal of Megalopolises with Precedence Conditions and Cost Functions Depending on a List of TasksChentsov, A. G.; Chentsov, A. A.; Sesekin, A. N.
2021Optimal routing in a problem with constraints and cost functions depending on the task listChentsov, A. A.; Chentsov, A. G.; Sesekin, A. N.
2020Optimal skeleton huffman trees revisitedKosolobov, D.; Merkurev, O.
2018Optimizing multi-inserts in routing problems with constraintsChentsov, A. G.; Grigor'Ev, A. M.
2018Optimizing the Starting Point in a Precedence Constrained Routing Problem with Complicated Travel Cost FunctionsChentsov, A. G.; Grigoryev, A. M.; Chentsov, A. A.
2022Reducing the Exposure Dose by Optimizing the Route of Personnel Movement When Visiting Specified Points and Taking into Account the Avoidance of ObstaclesTashlykov, O. L.; Grigoryev, A. M.; Kropachev, Y. A.
2015Restricted Dynamic Programming Heuristic for Precedence Constrained Bottleneck Generalized TSPSalii, Y.
2019The routing problems with optimization of the starting point: Dynamic programmingChentsov, A. G.; Chentsov, P. A.
2016Routing problems: constraints and optimalityChentsov, A. G.; Chentsov, P. A.; Petunin, A. A.; Sesekin, A. N.
2022SOME APPLICATIONS OF OPTIMIZATION ROUTING PROBLEMS WITH ADDITIONAL CONSTRAINTSPetunin, A. A.; Chentsov, A. G.; Chentsov, P. A.
2021To the application of two-stage dynamic programming in the problem of sequential visiting of megalopolisesChentsov, A. G.; Chentsov, P. A.
Отображение результатов 15 до 34 из 44 < назад   дальше >