| Article ID: | iaor19921494 |
| Country: | United Kingdom |
| Volume: | 29 |
| Start Page Number: | 96 |
| End Page Number: | 100 |
| Publication Date: | Dec 1989 |
| Journal: | USSR Computational Mathematics and Mathematical Physics |
| Authors: | Chentsov A.G., Koratayeva L.N. |
| Keywords: | programming: travelling salesman |
A time-optimal control problem is considered for a simple trajectory visiting a given finite system of goal sets. The Bellman function is constructed and a recursive evaluation algorithm is developed. Numerical implementation examples are presented.