Dynamic programming in a nonstationary route problem

被引：0

作者：

Chentsov, A. G. ^{[1
,2
]}

Chentsov, P. A. ^{[2
,3
]}

机构：

[1] Russian Acad Sci, Ul S Kovalevskoi 16, Ekaterinburg 620990, Russia

[2] Russian Acad Sci, Ural Branch, Inst Math & Mech, Ekaterinburg 620990, Russia

[3] Russian Acad Sci, Ural Branch, Phys & Math, Ekaterinburg 620990, Russia

来源：

IZVESTIYA INSTITUTA MATEMATIKI I INFORMATIKI-UDMURTSKOGO GOSUDARSTVENNOGO UNIVERSITETA | 2012年 / 01期

关键词：

route; preceding condition; Bellman function;

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

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.

引用

页码：151 / 154

页数：4