In this article, there is described an effective algorithm of solving a number of most important optimization problems of operational activities of divisions of EMERCOM of Russia based on graph theory.
optimization, routes of movement, cycles of gamilton
1. Kristofides N. Teoriya grafov. Algoritmicheskiy podhod. M.: Mir,1978.
2. Berzh K. Teoriya grafov i ee primenenie. M.: Mir, 1962.
3. Roberts S.M., Flores B. Fn engineering approach to the travelling salesman problem // Man. Sci. 1967. № 13. P. 269.
4. Roberts S.M., Flores B. Systematic generation of Hamiltonian circuits // Comm. Of ACM. 1966. № 9. P. 690.
5. Danielson G.H. On finding the simple paths and circuits in a graph // IREE Trans. CT-15. 1968. P. 294.
6. Romanovskiy I.V. Algoritmy resheniya ekstremal'nyh zadach. M.: Nauka, 1977.
7. Pósa L. A theorem concerning Hamilton lines // Magyar Tnd. Akad. Mt. Kutató Int. Közl. 1962. № 7. P. 225.
8. Nash-Williams, C. St. J. A. On Hamiltonian circuits in finite graphs // Proc. American Mathematical Soc. 1966. № 17. P. 466.
9. Ore O. Theory of Graphs // American Mathematical Society. 1962. Vol. XXXVIII.
10. Dhawan V. Hamiltonian circuits and related problems in graph theory. London: Imperial College, 1969.
