Vestnik YuUrGU. Ser. Mat. Model. Progr., 2012, Issue 12, Pages 53–76
This article is cited in 3 scientific papers (total in 3 papers)
A Parallel Procedure of Constructing Bellman Function in the Generalized Courier Problem with Interior Works
A. G. Chentsov
Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences (Yekaterinburg, Russian Federation)
A construction of the parallel realization of dynamic programming method for solving the problem of sequential visiting for sets (megalopolises) with constraints in the form of preceding conditions; this problem is called generalized courier problem. It is supposed that, on these sets, the works with inputs are fulfilled. The computing procedure used partial constructing of the Bellman function array and realized by layers of the position space is investigated. In the foundation of construction the idea of a discrete dynamic system is situated; for this system, attainability domains realized by recurrence scheme are constructed.
route, megalopolis, dynamic programming.
PDF file (4370 kB)
A. G. Chentsov, “A Parallel Procedure of Constructing Bellman Function in the Generalized Courier Problem with Interior Works”, Vestnik YuUrGU. Ser. Mat. Model. Progr., 2012, no. 12, 53–76
Citation in format AMSBIB
\paper A Parallel Procedure of Constructing Bellman Function in the Generalized Courier Problem with Interior Works
\jour Vestnik YuUrGU. Ser. Mat. Model. Progr.
Citing articles on Google Scholar:
Related articles on Google Scholar:
Cycle of papers
This publication is cited in the following articles:
A. G. Chentsov, “K voprosu o marshrutizatsii kompleksov rabot”, Vestn. Udmurtsk. un-ta. Matem. Mekh. Kompyut. nauki, 2013, no. 1, 59–82
A. G. Chentsov, A. A. Chentsov, A. M. Grigorev, “Ob odnoi zadache marshrutizatsii, modeliruyuschei peremescheniya v radiatsionnykh polyakh”, Vestn. Udmurtsk. un-ta. Matem. Mekh. Kompyut. nauki, 27:4 (2017), 540–557
A. G. Chentsov, A. M. Grigoryev, A. A. Chentsov, “Solving a routing problem with the aid of an independent computations scheme”, Vestn. YuUrGU. Ser. Matem. modelirovanie i programmirovanie, 11:1 (2018), 60–74
|Number of views:|