|
Trudy Instituta Matematiki i Mekhaniki UrO RAN, 2010, Volume 16, Number 1, Pages 152–170
(Mi timm535)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
One bottleneck routing problem
A. N. Sesekin, A. A. Chentsov, A. G. Chentsov Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences
Abstract:
An extremal routing problem with a criterion that has the sense of the greatest 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.
Keywords:
routing, precedence conditions.
Received: 30.11.2009
Citation:
A. N. Sesekin, A. A. Chentsov, A. G. Chentsov, “One bottleneck routing problem”, Trudy Inst. Mat. i Mekh. UrO RAN, 16, no. 1, 2010, 152–170; Proc. Steklov Inst. Math. (Suppl.), 272, suppl. 1 (2011), S165–S185
Linking options:
https://www.mathnet.ru/eng/timm535 https://www.mathnet.ru/eng/timm/v16/i1/p152
|
Statistics & downloads: |
Abstract page: | 486 | Full-text PDF : | 128 | References: | 95 | First page: | 3 |
|