Routing Problems of Movement. 2nd edition

The textbook is devoted to the study of the tasks of routing with restrictions with their source a well -known task of the salesman. The performances under consideration make sense of the task of visiting megacities, subject to some conditions of preceding. The Bellman equation is justified, a numerical algorithm for constructing the Bellman function and the algorithm for finding the optimal route and the visit to megalopolises are considered. A generalization of the task of visiting megacities was also obtained in the case when the cost function in a clearly depends on the list of unfulfilled tasks. As an example, a model example of the task of minimizing the dose load when performing repair and preventive work at nuclear power plants is analyzed.
A textbook is intended for students of specialty mathematics, as well as for students, graduate students and specialists interested in the methods of optimization and research of operations.
2- edition, stereotypical