On a bottleneck routing problem / Sesekin A. N.,Chentsov A. A.,Chentsov A. G. // PROCEEDINGS OF THE STEKLOV INSTITUTE OF MATHEMATICS. - 2011. - V. 272, l. 1. - P. 165-185.

ISSN/EISSN:

0081-5438 / нет данных

Type:

Article

Abstract:

An extremal routing problem with a criterion that has the sense of the largest edge length of a polygonal line is considered. It is assumed that the costs at every step (stage) of the travel may depend on a list of tasks that have not been fulfilled by the beginning of this step. In addition, there are constraints in the form of precedence conditions. An economical variant of the procedure is constructed based on the dynamic programming method.

Author keywords:

routing; precedence conditions

DOI:

10.1134/S0081543811020131

Web of Science ID:

ISI:000289527400013

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

—

Другие поля

Поле	Значение
Month	APR
Publisher	MAIK NAUKA/INTERPERIODICA/SPRINGER
Address	233 SPRING ST, NEW YORK, NY 10013-1578 USA
Language	English
Research-Areas	Mathematics
Web-of-Science-Categories	Mathematics, Applied; Mathematics
Author-Email	sesekin@imm.uran.ru chentsov@imm.uran.ru
ORCID-Numbers	Sesekin, Alexander/0000-0002-1339-9044
Funding-Acknowledgement	Russian Foundation for Basic Research {[}09-01-00436]; Presidium of the Russian Academy of Sciences
Funding-Text	This work was supported by the Russian Foundation for Basic Research (project no. 09-01-00436) and by the Program for Fundamental Research of the Presidium of the Russian Academy of Sciences ``Mathematical Theory of Control.{''}
Number-of-Cited-References	9
Usage-Count-Since-2013	2
Journal-ISO	Proc. Steklov Inst. Math.
Doc-Delivery-Number	750EJ