Электронный научный архив УрФУ: Просмотр архива электронных ресурсов

Просмотр коллекции по группе - По тематике 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
А Б В Г Д Е Ж З И Й К Л М Н О П Р С Т У Ф Х Ц Ч Ш Щ Ъ Ы Ь Э Ю Я
или введите несколько первых букв:

Отображение результатов 11 до 30 из 42 < назад дальше >

Дата публикации	Название	Авторы
2016	Linear time algorithm for Precedence Constrained Asymmetric Generalized Traveling Salesman Problem	Chentsov, A.; Khachay, M.; Khachay, D.
2019	Linear Time Maximum Segmentation Problems in Column Stream Model	Cazaux, B.; Kosolobov, D.; Mäkinen, V.; Norri, T.
2019	Linear time minimum segmentation enables scalable founder reconstruction	Norri, T.; Cazaux, B.; Kosolobov, D.; Mäkinen, V.
2023	Minimax routing problem with a system of priority tasks	Chentsov, A. G.; Chentsov, A. A.
2017	On one routing problem modeling movement in radiation fields	Chentsov, A. G.; Chentsov, A. A.; Grigoryev, A. M.
2020	On one routing problem with non-additive cost aggregation	Chentsov, A. G.; Chentsov, A. A.; Sesekin, A. N.
2016	On Parameterized Complexity of Hitting Set Problem for Axis–Parallel Squares Intersecting a Straight Line	Khachay, D. M.; Khachay, M. Yu.
2020	On Routing Problem with Starting Point Optimization	Chentsov, Alexander G.; Chentsov, Pavel A.
2020	On routing problem with starting point optimization	Chentsov, A. G.; Chentsov, P. A.
2021	On sequential traversal of sets	Chentsov, A. G.; Chentsov, P. A.
2023	ON THE APPLICATION OF THE MINIMAX TRAVELING SALESMAN PROBLEM IN AVIATION LOGISTICS	Chentsov, A. G.; Chentsov, A. A.; Sesekin, A. N.
2020	On the Problem of Sequential Traversal of Megalopolises with Precedence Conditions and Cost Functions Depending on a List of Tasks	Chentsov, A. G.; Chentsov, A. A.; Sesekin, A. N.
2021	On the Problem of Sequential Traversal of Megalopolises with Precedence Conditions and Cost Functions Depending on a List of Tasks	Chentsov, A. G.; Chentsov, A. A.; Sesekin, A. N.
2021	Optimal routing in a problem with constraints and cost functions depending on the task list	Chentsov, A. A.; Chentsov, A. G.; Sesekin, A. N.
2020	Optimal skeleton huffman trees revisited	Kosolobov, D.; Merkurev, O.
2018	Optimizing multi-inserts in routing problems with constraints	Chentsov, A. G.; Grigor'Ev, A. M.
2018	Optimizing the Starting Point in a Precedence Constrained Routing Problem with Complicated Travel Cost Functions	Chentsov, A. G.; Grigoryev, A. M.; Chentsov, A. A.
2022	Reducing the Exposure Dose by Optimizing the Route of Personnel Movement When Visiting Specified Points and Taking into Account the Avoidance of Obstacles	Tashlykov, O. L.; Grigoryev, A. M.; Kropachev, Y. A.
2015	Restricted Dynamic Programming Heuristic for Precedence Constrained Bottleneck Generalized TSP	Salii, Y.
2019	The routing problems with optimization of the starting point: Dynamic programming	Chentsov, A. G.; Chentsov, P. A.

Отображение результатов 11 до 30 из 42 < назад дальше >