The routing problems with optimization of the starting point: dynamic programming

IF 0.3 Q4 MATHEMATICS Izvestiya Instituta Matematiki i Informatiki-Udmurtskogo Gosudarstvennogo Universiteta Pub Date : 2019-12-09 DOI:10.20537/2226-3594-2019-54-08

Chentsov Aleksandr Georgievich, Chentsov Pavel Aleksandrovich

引用次数: 2

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

带优化起点的路径问题:动态规划

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

Izvestiya Instituta Matematiki i Informatiki-Udmurtskogo Gosudarstvennogo Universiteta MATHEMATICS-

CiteScore

1.00

自引率

0.00%

发文量

期刊最新文献

Integration of the mKdV Equation with nonstationary coefficients and additional terms in the case of moving eigenvalues On the exploitation of a population given by a system of linear equations with random parameters Asymptotic expansion of the solution to an optimal control problem for a linear autonomous system with a terminal convex quality index depending on slow and fast variables Algorithms for constructing suboptimal coverings of plane figures with disks in the class of regular lattices A bottleneck routing problem with a system of priority tasks