|
|
|
|
References
|
|
| |
| 1. |
Melamed I. I., Sergeev S. I., Sigal I. Kh., “The traveling salesman problem. I: Theoretical issues”, Automation and Remote Control, 50:9 (1989), 1147–1173    |
| 2. |
Melamed I. I., Sergeev S. I., Sigal I. Kh., “The traveling salesman problem. II: Exact methods”, Automation and Remote Control, 50:10 (1989), 1303–1324 |
| 3. |
Melamed I. I., Sergeev S. I., Sigal I. Kh., “The traveling salesman problem. Approximate algorithms”, Automation and Remote Control, 50:11 (1989), 1459–1479 |
| 4. |
Gutin G., Punnen A. P., The traveling salesman problem and its variations, Springer US, 2007  |
| 5. |
Cook W. J., In pursuit of the traveling salesman. Mathematics at the limits of computation, Princeton University Press, 2012, 248 pp. |
| 6. |
Bellman R., “Application of dynamic programming method for the traveling salesman problem”, Kibernet. Sb., 9, Mir, M., 1964, 219–228 (in Russian) |
| 7. |
Kheld M., Karp R. M., “Application of dynamic programming method for the sorting problems”, Kibernet. Sb., 9, Mir, M., 1964, 202–218 (in Russian) |
| 8. |
Little J. D. C., Murty K. G., Sweeney D. W., Karel C., “An algorithm for the traveling salesman problem”, Operations Research, 11:6 (1963), 972–989 |
| 9. |
Chentsov A. G., Extremal problems of routing and assignment of tasks: questions of theory, Regular and Chaotic Dynamics, Institute of Computer Science, M.–Izhevsk, 2008, 240 pp. |
| 10. |
Sesekin A. N., Chentsov A. A., Chentsov A. G., “A generalized courier problem with the cost function depending on the list of tasks”, Journal of Computer and Systems Sciences International, 49:2 (2010), 234–243 |
| 11. |
Chentsov A. G., Chentsov A. A., “Route problem with constraints depending on a list of tasks”, Doklady Mathematics, 92:3 (2015), 685–688  |
| 12. |
Chentsov A. G., “Problem of successive megalopolis traversal with the precedence conditions”, Automation and Remote Control, 75:4 (2014), 728–744 |
| 13. |
Chentsov A. G., Chentsov P. A., “Routing under constraints: problem of visit to megalopolises”, Automation and Remote Control, 77:11 (2016), 1957–1974 |
| 14. |
Chentsov A. G., “The Bellmann insertions in the route problem with constraints and complicated cost functions”, Vestn. Udmurt. Univ. Mat. Mekh. Komp'yut. Nauki, 2014, no. 4, 122–141 (in Russian) |
| 15. |
Korobkin V. V., Sesekin A. N., Tashlykov O. L., Chentsov A. G., Routing methods and their applications in problems of improving the safety and efficiency of operation of nuclear power plants, Novye Tekhnologii, M., 2012, 234 pp. |
| 16. |
Petunin A. A., “About some strategies of the programming of tool route by developing of control programs for thermal cutting machines”, Vestnik Ufimskogo Gosudarstvennogo Aviatsionnogo Tekhnicheskogo Universiteta. Seriya: Upravlenie, Vychislitel'naya Tekhnika i Informatika, 13:2(35) (2009), 280–286 (in Russian) |
| 17. |
Petunin A. A., Chentsov A. G., Chentsov P. A., “To the question about instrument routing in the automated machines of the sheet cutting”, St. Petersburg State Polytechnical University Journal. Computer Science. Telecommunication and Control Systems, 2013, no. 2(169), 103–111 (in Russian) |
| 18. |
Aleksandrov P. S., Markushevich A. I., Khinchin A. Ya., Encyclopedia of Elementary Mathematics, v. 3, Functions and Limits, GITTL, M.–L., 1952, 559 pp. |
| 19. |
Kuratowski K., Mostowski A., Set theory, North-Holland, Amsterdam, 1967, xi+417 pp. |
| 20. |
Dieudonne J., Foundations of modern analysis, Academic Press, New York, 2006, 408 pp. |
| 21. |
Cormen T., Leiserson Ch., Rivest R., Introduction to algorithms, 1st ed., MIT Press and McGraw-Hill, 1990 |
| 22. |
Gimadi E. Kh., Khachai M. Yu., Ekstremal'nye zadachi na mnozhestvakh perestanovok, UMC UPI, Yekaterinburg, 2016, 216 pp. |
| 23. |
Chentsov A. G., “The Bellmann insertions in the route problem with constraints and complicated cost functions. II”, Vestn. Udmurt. Univ. Mat. Mekh. Komp'yut. Nauki, 26:4 (2016), 565–578 |
| 24. |
Petunin A. A., Chentsov A. A., Chentsov A. G., Chentsov P. A., “Elements of dynamic programming in local improvement constructions for heuristic solutions of routing problems with constraints”, Automation and Remote Control, 78:4 (2017), 666–681 |
