Route problem with constraints depending on a list of tasks / Chentsov A. G.,Chentsov A. A. // DOKLADY MATHEMATICS. - 2015. - V. 92, l. 3. - P. 685-688.

ISSN/EISSN:

1064-5624 / 1531-8362

Type:

Article

Abstract:

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.

Author keywords:

нет данных

DOI:

10.1134/S1064562415060083

Web of Science ID:

ISI:000368186800010

Соавторы в МНС:

—

Другие поля

Поле	Значение
Month	NOV
Publisher	MAIK NAUKA/INTERPERIODICA/SPRINGER
Address	233 SPRING ST, NEW YORK, NY 10013-1578 USA
Language	English
EISSN	1531-8362
Research-Areas	Mathematics
Web-of-Science-Categories	Mathematics
Author-Email	chentsov.@imm.uran.ru chentsov.a@binsys.ru
Funding-Acknowledgement	Russian Foundation for Basic Research {[}15-01-07909]
Funding-Text	This work was supported by the Russian Foundation for Basic Research, project no. 15-01-07909.
Number-of-Cited-References	15
Usage-Count-Since-2013	2
Journal-ISO	Dokl. Math.
Doc-Delivery-Number	DB0GO