|
Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 2010, Number 6, Pages 64–81
(Mi ivm6946)
|
|
|
|
This article is cited in 17 scientific papers (total in 17 papers)
An extremal constrained routing problem with internal losses
A. A. Chentsov, A. G. Chentsov, P. A. Chentsov Institute of Mathematics and Mechanics, Ural Branch of the
Russian Academy of Sciences, Ekaterinburg, Russia
Abstract:
We consider the following problem: one has to visit a finite number of sets and perform certain work on each of them. The work is accompanied by certain (internal) losses. The movements from some set to another one are constrained and accompanied by external (aggregated additively) losses. We propose a “through” variant of the dynamic programming method, formulate an equivalent reconstruction problem, and develop an optimal algorithm based on an efficient dynamic programming method technique.
Keywords:
dynamic programming, precedence conditions, reconstruction problem.
Received: 25.05.2008
Citation:
A. A. Chentsov, A. G. Chentsov, P. A. Chentsov, “An extremal constrained routing problem with internal losses”, Izv. Vyssh. Uchebn. Zaved. Mat., 2010, no. 6, 64–81; Russian Math. (Iz. VUZ), 54:6 (2010), 54–68
Linking options:
https://www.mathnet.ru/eng/ivm6946 https://www.mathnet.ru/eng/ivm/y2010/i6/p64
|
Statistics & downloads: |
Abstract page: | 571 | Full-text PDF : | 113 | References: | 80 | First page: | 8 |
|