{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T05:05:54Z","timestamp":1774501554926,"version":"3.50.1"},"reference-count":28,"publisher":"Pleiades Publishing Ltd","issue":"11","license":[{"start":{"date-parts":[[2016,11,1]],"date-time":"2016-11-01T00:00:00Z","timestamp":1477958400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2016,11,1]],"date-time":"2016-11-01T00:00:00Z","timestamp":1477958400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Autom Remote Control"],"published-print":{"date-parts":[[2016,11]]},"DOI":"10.1134\/s0005117916110060","type":"journal-article","created":{"date-parts":[[2016,11,11]],"date-time":"2016-11-11T05:48:39Z","timestamp":1478843319000},"page":"1957-1974","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Routing under constraints: Problem of visit to megalopolises"],"prefix":"10.1134","volume":"77","author":[{"given":"A. G.","family":"Chentsov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. A.","family":"Chentsov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"137","published-online":{"date-parts":[[2016,11,12]]},"reference":[{"issue":"2","key":"534_CR1","first-page":"280","volume":"13","author":"A.A. Petunin","year":"2009","unstructured":"Petunin, A.A., On some Strategies of Forming Tool Routes at Developing the Control Programs for the Thermal Machine Cutting, Vestn. UGATU, Ser. Upravl., Vychisl. Tekhn., Informat., 2009, vol. 13, no. 2 (35), pp. 280\u2013286.","journal-title":"Vestn. UGATU, Ser. Upravl., Vychisl. Tekhn., Informat."},{"key":"534_CR2","first-page":"63","volume":"4","author":"V.D. Frolovskii","year":"2005","unstructured":"Frolovskii, V.D., Computer-aided Design of the Control Programs for Thermal Metal Cutting on NPC Machines, Inform. Tekhnol. Proektir., Proizvod., 2005, no. 4, pp. 63\u201366.","journal-title":"Inform. Tekhnol. Proektir., Proizvod."},{"issue":"169","key":"534_CR3","first-page":"103","volume":"2","author":"A.A. Petunin","year":"2013","unstructured":"Petunin, A.A., Chentsov, A.G., and Chentsov, P.A., On Routing Tool Motion on the Sheet Cutting NPC Machines, in Nauch.-tekhn. Vedomosti SPbGPU, Ser. Inform., Telekommunik., Control, 2013, no. 2 (169), pp. 103\u2013111.","journal-title":"Nauch.-tekhn. Vedomosti SPbGPU, Ser. Inform., Telekommunik., Control"},{"issue":"2","key":"534_CR4","doi-asserted-by":"publisher","first-page":"278","DOI":"10.18255\/1818-1015-2015-2-278-294","volume":"22","author":"A.A. Petunin","year":"2015","unstructured":"Petunin, A.A., Chentsov, A.G., and Chentsov, P.A., On One Problems of Routing Tool Transfer at Sheet Cutting of Parts, in Modelir. Analiz Inform. Sistem, 2015, vol. 22, no. 2, pp. 278\u2013294.","journal-title":"Modelir. Analiz Inform. Sistem"},{"key":"534_CR5","volume-title":"The Traveling Salesman Problem and Its Variations","author":"G. Gutin","year":"2002","unstructured":"Gutin, G., and Punnen, A., The Traveling Salesman Problem and Its Variations, Berlin: Springer, 2002."},{"issue":"1","key":"534_CR6","first-page":"20","volume":"453","author":"A.G. Chentsov","year":"2013","unstructured":"Chentsov, A.G. and Chentsov, A.A., Dynamic Programming of the Problems of Routing with Constraints and Costs Depending on the List of Jobs, Dokl. Ross. Akad. Nauk, 2013, vol. 453, no. 1, pp. 20\u201323.","journal-title":"Dokl. Ross. Akad. Nauk"},{"issue":"4","key":"534_CR7","first-page":"178","volume":"21","author":"M.S. Kosheleva","year":"2015","unstructured":"Kosheleva, M.S., Chentsov, A.A., and Chentsov, A.G., On Problem of Routing with Constraints Including Dependence on the List of Jobs, Tr. Inst. Mat. Mekh., 2015, vol. 21, no. 4, pp. 178\u2013195.","journal-title":"Tr. Inst. Mat. Mekh."},{"key":"534_CR8","volume-title":"Moscow\u2013Izhevsk: NITS \u201cRegulyarnaya i Khaoticheskaya Dinamika,\u201d Izhev. Inst. Komp\u2019yut. Issled","author":"A.G. Chentsov","year":"2008","unstructured":"Chentsov, A.G., Ekstremal\u2019nye zadachi marshrutizatsii i raspredeleniya zadanii: voprosy teorii (Extremal Problems of Routing and Assignment of Jobs: Questions of Theory), Moscow\u2013Izhevsk: NITS \u201cRegulyarnaya i Khaoticheskaya Dinamika,\u201d Izhev. Inst. Komp\u2019yut. Issled, 2008."},{"issue":"4","key":"534_CR9","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1134\/S0005117914040122","volume":"75","author":"A.G. Chentsov","year":"2014","unstructured":"Chentsov, A.G., Problem of Successive Megalopolis Traversal with the Precedence Conditions, Autom. Remote Control, 2014, vol. 75, no. 4, pp. 728\u2013744.","journal-title":"Autom. Remote Control"},{"issue":"11","key":"534_CR10","doi-asserted-by":"publisher","first-page":"2195","DOI":"10.1080\/00207540500070376","volume":"43","author":"G.G. Wang","year":"2005","unstructured":"Wang, G.G. and Xie, S.Q., Optimal Process Planning for a Combined Punch-and-Laser Cutting Machine Using Ant Colony Optimization, Int. J. Product. Res., 2005, vol. 43 (11), pp. 2195\u20132216.","journal-title":"Int. J. Product. Res."},{"key":"534_CR11","doi-asserted-by":"crossref","unstructured":"Lee, M.-K. and Kwon, K.-B., Cutting Path Optimization in NC Cutting Processes Using a Two-step Genetic Algorithm, Int. J. Product. Res., 2006, vol. 44 (24), pp. 5307\u20135326.","DOI":"10.1080\/00207540600579615"},{"key":"534_CR12","doi-asserted-by":"publisher","first-page":"454","DOI":"10.4028\/www.scientific.net\/AMR.796.454","volume":"796","author":"Y. Jing","year":"2013","unstructured":"Jing, Y. and Zhige, C., An Optimized Algorithm of Numerical Cutting-Path Control in Garment Manufacturing, Adv. Mater. Res., 2013, vol. 796, pp. 454\u2013457.","journal-title":"Adv. Mater. Res."},{"issue":"3","key":"534_CR13","first-page":"201","volume":"9","author":"N.D. Ganelina","year":"2006","unstructured":"Ganelina, N.D. and Frolovskii, V.D., Study of the Methods for Constructing the Shortest Path to Round the Segments on Plane, Sib. Zh. Vychisl. Mat., 2006, vol. 9, no. 3, pp. 201\u2013212.","journal-title":"Sib. Zh. Vychisl. Mat."},{"key":"534_CR14","unstructured":"Verkhoturov, M.A. and Tarasenko, P.Yu., Software for the Problems of Optmization of the Cutting Tool Path for Planar Figure Cutting on the Basis of Chain Cutting, Vestn. UGATU, Upravlen., VTiIT, 2008, vol. 10, no. 2 (27), pp. 123\u2013130."},{"key":"534_CR15","first-page":"219","volume":"9","author":"R. Bellman","year":"1964","unstructured":"Bellman, R., Application of the Dynamic Programming Method to the Travelling Salesman Problem, in Kiberneticheskii Sbornik (Cybernetical Series), Moscow: Mir, 1964, vol. 9, pp. 219\u2013228.","journal-title":"Kiberneticheskii Sbornik (Cybernetical Series), Moscow: Mir"},{"issue":"1","key":"534_CR16","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1137\/0110015","volume":"10","author":"M. Held","year":"1962","unstructured":"Held, M. and Karp, R.M., A Dynamic Programming Approach to Sequencing Problems, J. Soc. Ind. Appl. Math., 1962, no. 10 (1), pp. 196\u2013210.","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"534_CR17","volume-title":"Pursuit of the Traveling Salesman. Mathematics at the Limits of Computation","author":"W.J. i Cook","year":"2012","unstructured":"Cook, W.J., in Pursuit of the Traveling Salesman. Mathematics at the Limits of Computation, Princeton: Princeton Univ. Press, 2012."},{"issue":"9","key":"534_CR18","first-page":"1147","volume":"50","author":"I.I. Melamed","year":"1989","unstructured":"Melamed, I.I., Sergeev, S.I., and Sigal, I.Kh., The Traveling Salesman Problem. Issues in Theory, Autom. Remote Control, 1989, vol. 50, no. 9, pp. 1147\u20131173.","journal-title":"Autom. Remote Control"},{"issue":"10","key":"534_CR19","first-page":"1303","volume":"50","author":"I.I. Melamed","year":"1989","unstructured":"Melamed, I.I., Sergeev, S.I., and Sigal, I.Kh., The Traveling Salesman\u2019s Problem. Exact Methods, Autom. Remote Control, 1989, vol. 50, no. 10, pp. 1303\u20131324.","journal-title":"Autom. Remote Control"},{"issue":"11","key":"534_CR20","first-page":"1459","volume":"50","author":"I.I. Melamed","year":"1989","unstructured":"Melamed, I.I., Sergeev, S.I., and Sigal, I.Kh., The Traveling Salesman\u2019s Problem. Approximate Algorithms, Autom. Remote Control, 1989, vol. 50, no. 11, pp. 1459\u20131479.","journal-title":"Autom. Remote Control"},{"key":"534_CR21","unstructured":"Korobkin, V.V., Sesekin, A.N., Tashlykov, O.L., and Chentsov, A.G., Methods of Routing with Application to the Problems of Safety Enhancement and Operational Effectiveness of Nuclear Power Plants, Kalyaev, I.A., Ed., Moscow: Novye Tekhnologii, 2012."},{"key":"534_CR22","volume-title":"Set Theory","author":"K. Kuratovwski","year":"1970","unstructured":"Kuratovwski, K. and Mostowski, A., Set Theory, Amsterdam: North-Holland, 1967. Translated under the title Teoriya mnozhestv, Moscow: Mir, 1970."},{"key":"534_CR23","volume-title":"Foundations of Modern Analysis","author":"J. Dieudonn\u00e9","year":"1960","unstructured":"Dieudonn\u00e9, J., Foundations of Modern Analysis, New York: Academic, 1960. Translated under the title Osnovy sovremennogo analiza, Moscow: Mir, 1964."},{"key":"534_CR24","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2002","unstructured":"Cormen, T.H., Leizerson, C.E., and Rivest, R.L., Introduction to Algorithms, Cambridge: MIT Press, 1990. Translated under the title Algoritmy. Postroenie i analiz, Moscow: MTsNTO, 2002."},{"key":"534_CR25","doi-asserted-by":"publisher","first-page":"59","DOI":"10.20537\/vm130107","volume":"1","author":"A.G. Chentsov","year":"2013","unstructured":"Chentsov, A.G., On Routing of Complexes, Vestn. UdGU, Mat. Mekh. Komp\u2019yut. Nauki, 2013, vol. 1, pp. 59\u201382.","journal-title":"Vestn. UdGU, Mat. Mekh. Komp\u2019yut. Nauki"},{"key":"534_CR26","first-page":"12","volume":"5","author":"A.A. Chentsov","year":"2013","unstructured":"Chentsov, A.A., Chentsov, A.G., and Chentsov, P.A., Elements of Dynamic Programming in the Extremal Problems of Routing, Probl. Upravlen., 2013, no. 5, pp. 12\u201321.","journal-title":"Probl. Upravlen."},{"issue":"3","key":"534_CR27","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1134\/S0005117912030113","volume":"73","author":"A.G. Chentsov","year":"2012","unstructured":"Chentsov, A.G., On a Parallel Procedure for Constructing the Bellman Function in the Generalized Problem of Courier with Internal Jobs, Autom. Remote Control, 2012, vol. 73, no. 3, pp. 532\u2013546.","journal-title":"Autom. Remote Control"},{"key":"534_CR28","first-page":"41","volume":"1","author":"A.G. Chentsov","year":"2016","unstructured":"Chentsov, A.G. and Chentsov, A.A., On Finding the Value of the Routing Problem with Constraints, Probl. Upravlen. Informat., 2016, no. 1, pp. 41\u201354.","journal-title":"Probl. Upravlen. Informat."}],"container-title":["Automation and Remote Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0005117916110060.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0005117916110060","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0005117916110060.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:29:15Z","timestamp":1773613755000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0005117916110060"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11]]},"references-count":28,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2016,11]]}},"alternative-id":["534"],"URL":"https:\/\/doi.org\/10.1134\/s0005117916110060","relation":{},"ISSN":["0005-1179","1608-3032"],"issn-type":[{"value":"0005-1179","type":"print"},{"value":"1608-3032","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,11]]},"assertion":[{"value":"4 February 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 November 2016","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}