|
Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta, 2012, Issue 1(39), Pages 151–154
(Mi iimi72)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
Dynamic programming in a nonstationary route problem
A. G. Chentsov, P. A. Chentsov Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, Ekaterinburg
Abstract:
The variant of the dynamic programming method (DPM) is constructed for solving the route problem about megalopolis visiting with the singularity in the form of nonstationarity of permutation and (interior) works. The preceding conditions are given. Additive variant of the input aggregation is investigated.
Keywords:
route, preceding condition, Bellman function.
Received: 01.02.2012
Citation:
A. G. Chentsov, P. A. Chentsov, “Dynamic programming in a nonstationary route problem”, Izv. IMI UdGU, 2012, no. 1(39), 151–154
Linking options:
https://www.mathnet.ru/eng/iimi72 https://www.mathnet.ru/eng/iimi/y2012/i1/p151
|
Statistics & downloads: |
Abstract page: | 294 | Full-text PDF : | 106 | References: | 50 |
|