Route problem with constraints depending on a list of tasks |
| |
| Authors: | A G Chentsov A A Chentsov |
| |
| Institution: | 1. Krasovskii Institute of Mathematics and Mechanics, Ural Branch, Russian Academy of Sciences, ul. S. Kovalevskoi 16, Yekaterinburg, 620219, Russia
2. Ural Federal University, ul. Mira 19, Yekaterinburg, 620002, Russia
|
| |
| 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. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
