Browsing by Subject DYNAMIC PROGRAMMING

Jump to: 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
А Б В Г Д Е Ж З И Й К Л М Н О П Р С Т У Ф Х Ц Ч Ш Щ Ъ Ы Ь Э Ю Я
or enter first few letters:  
Showing results 1 to 20 of 34  next >
Issue DateTitleAuthor(s)
2019Application of a generalized bottleneck routing problem to the task of adhering to acceptable doses of radiation during the dismantling of radiation hazardous objectsChentsov, A. A.; Chentsov, A. G.; Sesekin, A. N.; Tashlykov, O. L.
2016The Bellmann insertions in route problems with constraints and complicated cost functionsChentsov, A. G.
2018Bifurcation points of the generalized solution of the Hamilton-Jacobi-Bellman equationRodin, A. S.; Shagalova, L. G.
2018Dynamic programming in the generalized bottleneck problem and the start point optimizationChentsov, A. G.; Chentsov, A. A.; Sesekin, A. N.
2020Dynamic Programming Principle and Hamilton-jacobi-bellman Equations for Fractional-order SystemsGomoyunov, M. I.
2018Generalized a bottleneck routing problem: dynamic programming and the start point optimizationChentsov, A. A.; Chentsov, A. G.; Sesekin, A. N.
2016Generalized solutions of Hamilton-Jacobi equation to a molecular genetic modelSubbotina, N.; Shagalova, L.
2016Linear time algorithm for Precedence Constrained Asymmetric Generalized Traveling Salesman ProblemChentsov, A.; Khachay, M.; Khachay, D.
2019Linear Time Maximum Segmentation Problems in Column Stream ModelCazaux, B.; Kosolobov, D.; Mäkinen, V.; Norri, T.
2019Linear time minimum segmentation enables scalable founder reconstructionNorri, T.; Cazaux, B.; Kosolobov, D.; Mäkinen, V.
2017On one routing problem modeling movement in radiation fieldsChentsov, A. G.; Chentsov, A. A.; Grigoryev, A. M.
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.
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.
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.
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.