Dynamic programming method in extremal constrained routing problems

被引：2
|
作者：
Chentsov, A. G. [1 ]
机构：
[1] Russian Acad Sci, Ural Div, Inst Math & Mech, Ekaterinburg 620990, Russia
来源：
JOURNAL OF COMPUTER AND SYSTEMS SCIENCES INTERNATIONAL | 2010年 / 49卷 / 03期
基金：
俄罗斯基础研究基金会;
关键词：
ACKNOWLEDGMENTS The work was a part of the Mathematical control theory program of the Presidium of the Russian Academy of Sciences and was supported by the Rus sian Foundation for Basic Research (project no. 09 01 00436; 10; 01; 96020);
D O I：
10.1134/S1064230710030081
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
The problem of routing movements in a finite system of sets is considered. The problem is constrained by precedence conditions and by necessity of executing several (internal) jobs on the sets. The cost of execution of these jobs is summed up with the cost of performing (external) movements from set to set. The contents of the paper correspond to the presentation made by the author at the Conference on Control of Dynamical Systems (IPM RAS, Moscow, 2009).
引用
收藏
页码：392 / 405
页数：14
相关论文
共 50 条
12345