{"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":1774501554370,"version":"3.50.1"},"reference-count":26,"publisher":"Pleiades Publishing Ltd","issue":"5","license":[{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"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":[[2023,5]]},"DOI":"10.1134\/s0005117923050053","type":"journal-article","created":{"date-parts":[[2023,9,18]],"date-time":"2023-09-18T20:02:19Z","timestamp":1695067339000},"page":"543-563","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Two-Stage Dynamic Programming in the Routing Problem with Decomposition"],"prefix":"10.1134","volume":"84","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":[[2023,9,19]]},"reference":[{"key":"2407_CR1","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."},{"key":"2407_CR2","volume-title":"In Pursuit of the Traveling Salesman. Mathematics at the Limits of Computation","author":"W.J. Cook","year":"2012","unstructured":"Cook, W.J., In Pursuit of the Traveling Salesman. Mathematics at the Limits of Computation, Princeton: Princeton University Press, 2012."},{"key":"2407_CR3","unstructured":"Gimadi, E.Kh. and Khachai, M.Yu., Ekstremal\u2019nye zadachi na mnozhestvakh perestanovok (Extremal Problems on Permutation Sets), Yekaterinburg: UPI Training Center, 2016."},{"key":"2407_CR4","unstructured":"Melamed, I.I., Sergeev, S.I., and Sigal, I.Kh., The Traveling Salesman Problem, Autom. Remote Control, 1989, vol. 50, no. 9, pp. 1147\u20131173; no. 10, pp. 1303\u20131324; no. 11, pp. 1459\u20131479."},{"key":"2407_CR5","doi-asserted-by":"crossref","unstructured":"Little, J.D., Murty, K.G., Sweeney, D.W., and Karel, C., An Algorithm for the Traveling Salesman Problem, Oper. Res., 1963, no. 11(6), pp. 972\u2013989.","DOI":"10.1287\/opre.11.6.972"},{"key":"2407_CR6","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/321105.321111","volume":"9","author":"R. Bellman","year":"1962","unstructured":"Bellman, R., Dynamic Programming Treatment of the Travelling Salesman Problem, J. ACM, 1962, vol. 9, no.\u00a01, pp. 61\u201363.","journal-title":"J. ACM"},{"key":"2407_CR7","first-page":"196","volume":"10","author":"M. Held","year":"1962","unstructured":"Held, M. and Karp, R., A Dynamic Programming Approach to Sequencing Problems, J. SIAM, 1962, vol. 10, no. 1, pp. 196\u2013210.","journal-title":"J. SIAM"},{"key":"2407_CR8","unstructured":"Chentsov, A.G., Ekstremal\u2019nye zadachi marshrutizatsii i raspredeleniya zadanii: voprosy teorii (Extremal Problems of Routing and Task Distribution: Theoretical Fundamentals), Moscow\u2013Izhevsk: Regulyarnaya i Khaoticheskaya Dinamika, 2008."},{"key":"2407_CR9","unstructured":"Chentsov, A.G., Chentsov, A.A., and Sesekin, A.N., Zadachi marshrutizatsii peremeshchenii s neadditivnym agregirovaniem zatrat (Movement Routing Problems with Non-additive Cost Aggregation), Moscow: Lenand, 2021."},{"key":"2407_CR10","unstructured":"Petunin, A.A., Chentsov, A.G., and Chentsov, P.A., Optimal\u2019naya marshrutizatsiya instrumenta mashin figurnoi listovoi rezki s chislovym programmnym upravleniem. Matematicheskie modeli i algoritmy (Optimal Tool Routing of Shaped Sheet Cutting Machines with Computer Numerical Control. Mathematical Models and Algorithms), Yekaterinburg: Ural Federal University, 2020."},{"key":"2407_CR11","first-page":"95","volume":"27","author":"A.G. Chentsov","year":"2022","unstructured":"Chentsov, A.G. and Chentsov, P.A., Dynamic Programming in the Routing Problem: Decomposition Variant, Russian Universities Reports. \n               Mathematics, 2022, vol. 27, no. 137, pp. 95\u2013124.","journal-title":"Mathematics"},{"key":"2407_CR12","first-page":"215","volume":"28","author":"A.G. Chentsov","year":"2022","unstructured":"Chentsov, A.G. and Chentsov, P.A., An Extremal Two-Stage Routing Problem and Procedures Based on Dynamic Programming, Trudy Inst. Mat. i Mekh. \n               Ural. Otd. Ross. Akad. Nauk, 2022, vol. 28, no. 2, pp. 215\u2013248.","journal-title":"Ural. Otd. Ross. Akad. Nauk"},{"key":"2407_CR13","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"},{"key":"2407_CR14","doi-asserted-by":"publisher","first-page":"1957","DOI":"10.1134\/S0005117916110060","volume":"77","author":"A.G. Chentsov","year":"2016","unstructured":"Chentsov, A.G. and Chentsov, P.A., Routing under Constraints: Problem of Visit to Megalopolises, Autom. Remote Control, 2016, vol. 77, no. 11, pp. 1957\u20131974.","journal-title":"Autom. Remote Control"},{"key":"2407_CR15","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."},{"key":"2407_CR16","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."},{"key":"2407_CR17","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, no. 11, pp. 2195\u20132216.","journal-title":"Int. J. Product. Res."},{"key":"2407_CR18","doi-asserted-by":"crossref","unstructured":"Lee, M.-K. and Kwon, K.-B., Cutting Path Optimization in CNC Cutting Processes Using a Two-Step Genetic Algorithm, Int. J. Product. Res., 2006, no. 44, pp. 5307\u20135326.","DOI":"10.1080\/00207540600579615"},{"key":"2407_CR19","volume-title":"Set Theory","author":"K. Kuratowski","year":"1967","unstructured":"Kuratowski, K. and Mostowski, A., Set Theory, Amsterdam: North-Holland, 1967."},{"key":"2407_CR20","volume-title":"Foundations of Modern Analysis","author":"J. Dieudonn\u00e9","year":"1960","unstructured":"Dieudonn\u00e9, J., Foundations of Modern Analysis, New York: Academic, 1960."},{"key":"2407_CR21","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1990","unstructured":"Cormen, T.H., Leiserson, C.E., and Rivest, R.L., Introduction to Algorithms, Cambridge: MIT Press, 1990."},{"key":"2407_CR22","volume-title":"Optimal Control of Differential and Functional Equations","author":"J. Warga","year":"1972","unstructured":"Warga, J., Optimal Control of Differential and Functional Equations, New York: Academic, 1972."},{"key":"2407_CR23","unstructured":"Chentsov, A.G., On Routing Complexes of Jobs, Vestn. UdGU, \n               Mat. Mekh. Komp\u2019yut. Nauki, 2013, no. 1, pp.\u00a058\u201382."},{"key":"2407_CR24","unstructured":"Lawler, E.L., Efficient Implementation of Dynamic Programming Algorithms for Sequencing Problems, Report BW106, Amsterdam: Mathematisch Centrum, 1979, pp. 1\u201316."},{"key":"2407_CR25","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."},{"key":"2407_CR26","first-page":"209","volume":"7","author":"A.A. Petunin","year":"2022","unstructured":"Petunin, A.A., Chentsov, A.G., and Chentsov, P.A., Optimal Routing in Problems of Sequential Traversal of Megapolises in the Presence of Constraints, Chelyabinsk Physical and Mathematical Journal, 2022, vol. 7, no. 2, pp. 209\u2013233.","journal-title":"Chelyabinsk Physical and Mathematical Journal"}],"container-title":["Automation and Remote Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0005117923050053.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0005117923050053","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0005117923050053.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:37:37Z","timestamp":1773614257000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0005117923050053"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5]]},"references-count":26,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["2407"],"URL":"https:\/\/doi.org\/10.1134\/s0005117923050053","relation":{},"ISSN":["0005-1179","1608-3032"],"issn-type":[{"value":"0005-1179","type":"print"},{"value":"1608-3032","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5]]},"assertion":[{"value":"17 October 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 January 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 January 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 September 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}