Route problem with constraints depending on a list of tasks

被引：9

作者：

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

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

机构：

[1] Russian Acad Sci, Ural Branch, Krasovskii Inst Math & Mech, Ekaterinburg 620219, Russia

[2] Ural Fed Univ, Ekaterinburg 620002, Russia

来源：

DOKLADY MATHEMATICS | 2015年 / 92卷 / 03期

基金：

俄罗斯基础研究基金会;

关键词：

Remote Control; Travel Salesman Problem; Travel Salesman Problem; Computer Numerical Control; Bellman Equation;

D O I：

10.1134/S1064562415060083

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

An additive route problem with preceding conditions is considered in which the cost function and the move constraints both depend on a list of tasks that have not been performed by the current time. The problem is solved by applying a dynamic programming method that takes into account both these factors and is implemented in the construction of a (generally) incomplete array of Bellman function values.

引用

页码：685 / 688

页数：4

共 50 条

[1] Route problem with constraints depending on a list of tasks
A. G. Chentsov
A. A. Chentsov
Doklady Mathematics, 2015, 92 : 685 - 688
[2] Dynamic programming in the routing problem with constraints and costs depending on a list of tasks
A. G. Chentsov
A. A. Chentsov
Doklady Mathematics, 2013, 88 : 637 - 640
[3] Dynamic programming in the routing problem with constraints and costs depending on a list of tasks
Chentsov, A. G.
Chentsov, A. A.
DOKLADY MATHEMATICS, 2013, 88 (03) : 637 - 640
[4] A generalized courier problem with the cost function depending on the list of tasks
Sesekin, A. N.
Chentsov, A. A.
Chentsov, A. G.
JOURNAL OF COMPUTER AND SYSTEMS SCIENCES INTERNATIONAL, 2010, 49 (02) : 234 - 243
[5] A generalized courier problem with the cost function depending on the list of tasks
A. N. Sesekin
A. A. Chentsov
A. G. Chentsov
Journal of Computer and Systems Sciences International, 2010, 49 : 234 - 243
[6] On the Problem of Sequential Traversal of Megalopolises with Precedence Conditions and Cost Functions Depending on a List of Tasks
A. G. Chentsov
A. A. Chentsov
A. N. Sesekin
Proceedings of the Steklov Institute of Mathematics, 2021, 315 : S67 - S80
[7] On the Problem of Sequential Traversal of Megalopolises with Precedence Conditions and Cost Functions Depending on a List of Tasks
Chentsov, A. G.
Chentsov, A. A.
Sesekin, A. N.
PROCEEDINGS OF THE STEKLOV INSTITUTE OF MATHEMATICS, 2021, 315 (SUPPL 1) : S67 - S80
[8] ON THE PROBLEM OF SEQUENTIAL TRAVERSAL OF MEGALOPOLISES WITH PRECEDENCE CONDITIONS AND COST FUNCTIONS DEPENDING ON A LIST OF TASKS
Chentsov, A. G.
Chentsov, A. A.
Sesekin, A. N.
TRUDY INSTITUTA MATEMATIKI I MEKHANIKI URO RAN, 2020, 26 (03): : 219 - +
[9] SHORTEST ROUTE PROBLEM WITH CONSTRAINTS
JOKSCH, HC
JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 1966, 14 (02) : 191 - &
[10] BOUNDS ON LIST SCHEDULING OF UET TASKS WITH RESTRICTED RESOURCE CONSTRAINTS
LEUNG, JYT
INFORMATION PROCESSING LETTERS, 1979, 9 (04) : 167 - 170

← 1 2 3 4 5 →