PSI - Issue 40

A.G. Chentsov et al. / Procedia Structural Integrity 40 (2022) 105–111 Chentsov A.G., Chentsov P.A./ Structural Integrity Procedia 00 (2022) 000 – 000

111

7

Cook W. J. In pursuit of the traveling salesman: Mathematics at the limits of computation, Princeton University Press, Princeton, 2012, 228 pp. E.Gimadi and M. Khachay Extremal Problems on Sets of Permutations (UrFU Publ., Ekaterinburg, 2016), 220 p Melamed I.I., Sergeev S.I., Sigal I.Kh. The traveling salesman problem. Issues in theory. Autom. Remote Control, 1989, 9, 3 34; 10, 3 29; 11, pp.3 - 26 Korobkin V.V., Sesekin A.N., Tashlykov O.L., Chentsov A.G. Routing methods and their applications in improving the safety and efciency of operation of nuclear power plants. New technologies. (Moscow. 2019) 234 p. Petunin A.A., Chentsov A.G., Chentsov P.A. Optimal routing of machine tool for sheet metal cutting with numerical control. Mathematical models and algorithms / Yekaterinburg: Ural Publishing House. University, 2020. 248 p. - ISBN 978-5-7996-3016-4. Chentsov A.G. Ekstremal'nye zadachi marshrutizatsii i raspredeleniya zadanii: voprosy teorii [Extremal problems of routing and distribution of tasks: questions of theory]. Moscow; Izhevsk: RHD Pibl., 2008, 238 p. ISBN: 978-5-93972-654-2 . Bellman R. Dynamic programming treatment of the travelling salesman problem. J. ACM, 1962, vol. 9, no. 1, pp. 61 63. doi: 10.1145/321105.321111 Held M., Karp R.M. . A dynamic programming approach to sequencing problems. Journal of the Society for Industrial and Applied Mathematics, 1962, vol. 10, no. 1, pp. 196 210. doi: 10.1137/0110015 . Chentsov A.G., Chentsov P.A. Routing under constraints: problem of visit to megalopolises. Automation and Remote Control 77 (11), 1957 1974 (2016) pp.96 -117 A. G. Chentsov, P. A. Chentsov The routing problems with optimization of the starting point: dynamic programming, Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta, vol.54, 2019, pp.102 -121 Chentsov A.G., Chentsov A.A., Sesekin A.N. Routing problems with nonadditive cost aggregation. (Moscow. Lenand. 2020), pp.219 - 234 Kuratowski K., Mostowski A. Set theory, Amsterdam: North-Holland, 1967 416 p.