{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:35:52Z","timestamp":1774416952108,"version":"3.50.1"},"reference-count":21,"publisher":"Pleiades Publishing Ltd","issue":"4","license":[{"start":{"date-parts":[[2017,4,1]],"date-time":"2017-04-01T00:00:00Z","timestamp":1491004800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2017,4,1]],"date-time":"2017-04-01T00:00:00Z","timestamp":1491004800000},"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":[[2017,4]]},"DOI":"10.1134\/s0005117917040087","type":"journal-article","created":{"date-parts":[[2017,4,12]],"date-time":"2017-04-12T10:19:38Z","timestamp":1491992378000},"page":"666-681","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Elements of dynamic programming in local improvement constructions for heuristic solutions of routing problems with constraints"],"prefix":"10.1134","volume":"78","author":[{"given":"A. A.","family":"Petunin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. A.","family":"Chentsov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. G.","family":"Chentsov","sequence":"additional","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":[[2017,4,13]]},"reference":[{"issue":"9","key":"609_CR1","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":"609_CR2","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":"609_CR3","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 Problem. Approximate Algorithms, Autom. Remote Control, 1989, vol. 50, no. 11, pp. 1459\u20131479.","journal-title":"Autom. Remote Control"},{"issue":"2","key":"609_CR4","first-page":"280","volume":"13","author":"A.A. Petunin","year":"2009","unstructured":"Petunin, A.A., On Some Strategies for Constructing the Tool\u2019s Route in the Development of Controlling Programs for Thermal Cutting Machines, Vestn. UGATU, Ser. Upravlen., Vychisl. Tekh. Informatika, 2009, vol. 13, no. 2(35), pp. 280\u2013286.","journal-title":"Vestn. UGATU, Ser. Upravlen., Vychisl. Tekh. Informatika"},{"key":"609_CR5","first-page":"103","volume":"2","author":"A.A. Petunin","year":"2013","unstructured":"Petunin, A.A., Chentsov, A.G., and Chentsov, P.A., On Routing the Movement of the Tool in Sheet Cutting Machines with Digital Program Control, Nauch.-Tekhn. Vedomosti SPbGPU, Ser. Informatika. Telekommunikatsii. Upravlen., 2013, no. 2 (169), pp. 103\u2013111.","journal-title":"Nauch.-Tekhn. Vedomosti SPbGPU, Ser. Informatika. Telekommunikatsii. Upravlen."},{"key":"609_CR6","volume-title":"Ekstremal\u2019nye zadachi marshrutizatsii i raspredeleniya zadanii: voprosy teorii","author":"A.G. Chentsov","year":"2008","unstructured":"Chentsov, A.G., Ekstremal\u2019nye zadachi marshrutizatsii i raspredeleniya zadanii: voprosy teorii (Extremal Problems of Routing and Task Distribution: Theoretical Fundamentals), Moscow\u2013Izhevsk: RKhD, 2008."},{"key":"609_CR7","first-page":"61","volume":"3","author":"A.G. Chentsov","year":"2010","unstructured":"Chentsov, A.G., Dynamic Programming in Extremal Problems of Routing with Constraints, Izv. Ross. Akad. Nauk, Teor. Sist. Upravlen., 2010, no. 3, pp. 61\u201373.","journal-title":"Izv. Ross. Akad. Nauk, Teor. Sist. Upravlen."},{"key":"609_CR8","first-page":"58","volume":"1","author":"A.G. Chentsov","year":"2013","unstructured":"Chentsov, A.G., On Routing Complexes of Jobs, Vestn. UdGU, Mat. Mekh. Komp\u2019yut. Igry, 2013, no. 1, pp. 58\u201382.","journal-title":"Vestn. UdGU, Mat. Mekh. Komp\u2019yut. Igry"},{"issue":"1","key":"609_CR9","first-page":"20","volume":"453","author":"A.G. Chentsov","year":"2013","unstructured":"Chentsov, A.G. and Chentsov, A.A., Dynamic Programming in Routing Problem with Constraints and Costs Depending on the List of Tasks, Dokl. Akad. Nauk, 2013, vol. 453, no. 1, pp. 20\u201323.","journal-title":"Dokl. Akad. Nauk"},{"issue":"1","key":"609_CR10","first-page":"94","volume":"1","author":"Dz.h Litl","year":"1965","unstructured":"Litl, Dzh., Murti, K., Suini, D., and Kerel, K., Algorithm for the Traveling Salesman Problem, Ekon. Mat. Metod., 1965, vol. 1, no. 1, pp. 94\u2013107.","journal-title":"Ekon. Mat. Metod."},{"key":"609_CR11","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":"2","key":"609_CR12","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/0377-2217(88)90333-5","volume":"37","author":"L. Escudero","year":"1988","unstructured":"Escudero, L., An Inexact Algorithm for the Sequential Ordering Problem, Eur. J. Oper. Res., 1988, vol. 37, no. 2, pp. 236\u2013249.","journal-title":"Eur. J. Oper. Res."},{"key":"609_CR13","first-page":"143","volume":"6","author":"I.Kh. Sigal","year":"1990","unstructured":"Sigal, I.Kh., The Decomposition Approach to Solving Traveling Salesman Problem in High Dimensions and Some of Its Applications, Izv. Akad. Nauk SSSR, Tekhn. Kibern., 1990, no. 6, pp. 143\u2013155.","journal-title":"Izv. Akad. Nauk SSSR, Tekhn. Kibern."},{"key":"609_CR14","first-page":"63","volume":"4","author":"V.D. Frolovskii","year":"2005","unstructured":"Frolovskii, V.D., Automating the Design of Controlling Programs for Heat Metal Cutting on Equipment with Digital Program Control, Inform. Tekhnol. Proektirovan. Proizvod., 2005, no. 4, pp. 63\u201366.","journal-title":"Inform. Tekhnol. Proektirovan. Proizvod."},{"issue":"4","key":"609_CR15","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":"3","key":"609_CR16","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":"609_CR17","volume-title":"Set Theory","author":"K. Kuratowski","year":"1970","unstructured":"Kuratowski, K. and Mostowski, A., Set Theory, Amsterdam: North-Holland, 1967. Translated under the title Teoriya mnozhestv (Set Theory), Moscow: Mir, 1970."},{"key":"609_CR18","volume-title":"Algoritmy: Postroenie and Analiz","author":"T. Kormen","year":"1990","unstructured":"Kormen, T., Leizerson, Ch., and Rivest, R., Algoritmy: Postroenie and Analiz, Moscow: MTsNMO. 1990."},{"issue":"2","key":"609_CR19","first-page":"454","volume":"5","author":"A.A. Chentsov","year":"2014","unstructured":"Chentsov, A.A. and Chentsov, A.G., The Problem of Sequential Megalopolis Traversal, Vest. Tambov. Univ., Ser. Estestvenn. Tekh. Nauki, 2014, vol. 5, no. 2, pp. 454\u2013475.","journal-title":"Vest. Tambov. Univ., Ser. Estestvenn. Tekh. Nauki"},{"key":"609_CR20","first-page":"56","volume":"2","author":"A.A. Petunin","year":"2014","unstructured":"Petunin, A.A., Chentsov, A.G., and Chentsov, P.A., Local Insertions Based on Dynamic Programming in the Routing Problem with Constraints, Vestn. UdGU, Mat. Mekh. Komp\u2019yut. Igry, 2014, no. 2, pp. 56\u201375.","journal-title":"Vestn. UdGU, Mat. Mekh. Komp\u2019yut. Igry"},{"issue":"4","key":"609_CR21","first-page":"270","volume":"15","author":"A.A. Chentsov","year":"2009","unstructured":"Chentsov, A.A., Chentsov, A.G., and Chentsov, P.A., Method of Iterations in the Routing Problem with Internal Losses, Tr. Inst. Mat. Mekh. UrO RAN, 2009, vol. 15, no. 4, pp. 270\u2013289.","journal-title":"Tr. Inst. Mat. Mekh. UrO RAN"}],"container-title":["Automation and Remote Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0005117917040087.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0005117917040087","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0005117917040087.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:25:21Z","timestamp":1773613521000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0005117917040087"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["609"],"URL":"https:\/\/doi.org\/10.1134\/s0005117917040087","relation":{},"ISSN":["0005-1179","1608-3032"],"issn-type":[{"value":"0005-1179","type":"print"},{"value":"1608-3032","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,4]]},"assertion":[{"value":"13 October 2014","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 April 2017","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}