{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T07:46:29Z","timestamp":1773819989161,"version":"3.50.1"},"reference-count":29,"publisher":"Pleiades Publishing Ltd","issue":"3","license":[{"start":{"date-parts":[[2014,3,1]],"date-time":"2014-03-01T00:00:00Z","timestamp":1393632000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,3,1]],"date-time":"2014-03-01T00:00:00Z","timestamp":1393632000000},"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":[[2014,3]]},"DOI":"10.1134\/s0005117914030102","type":"journal-article","created":{"date-parts":[[2014,3,6]],"date-time":"2014-03-06T19:17:17Z","timestamp":1394133437000},"page":"537-550","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Elements of dynamic programming in extremal routing problems"],"prefix":"10.1134","volume":"75","author":[{"given":"A. A.","family":"Chentsov","sequence":"first","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":[[2014,3,8]]},"reference":[{"key":"41_CR1","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R. and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness, New York: Freeman, 1979."},{"issue":"9","key":"41_CR2","first-page":"1147","volume":"50","author":"II Melamed","year":"1989","unstructured":"Melamed, I.I., Sergeev, S.I., and Sigal, I.Kh., The Traveling Salesman Problem. I. Theoretical Issues, Autom. Remote Control, 1989, vol. 50, no. 9, part 1, pp. 1147\u20131173.","journal-title":"Autom. Remote Control"},{"issue":"10","key":"41_CR3","first-page":"1303","volume":"50","author":"II Melamed","year":"1989","unstructured":"Melamed, I.I., Sergeev, S.I., and Sigal, I.Kh., The Traveling Salesman Problem. II. Exact Methods, Autom. Remote Control, 1989, vol. 50, no. 10, part 1, pp. 1303\u20131324.","journal-title":"Autom. Remote Control"},{"issue":"11","key":"41_CR4","first-page":"1459","volume":"50","author":"II 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, part 1, pp. 1459\u20131479.","journal-title":"Autom. Remote Control"},{"issue":"1","key":"41_CR5","first-page":"94","volume":"1","author":"Dzh Litl","year":"1965","unstructured":"Litl, Dzh., Murti, K., Suini, D., and Kjerel, K., Algorithms for Solving the Traveling Salesman Problem, Ekonom. Mat. Metody, 1965, vol. 1, no. 1, pp. 94\u2013107.","journal-title":"Ekonom. Mat. Metody"},{"key":"41_CR6","first-page":"219","volume-title":"Kiberneticheskii Sbornik","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."},{"key":"41_CR7","first-page":"196","volume-title":"J. SIAM","author":"M Held","year":"1962","unstructured":"Held, M. and Karp, R., A Dynamic Programming Approach to Sequencing Problems, J. SIAM, 1962, no. 10(1), pp. 196\u2013210."},{"key":"41_CR8","volume-title":"Ekstremal\u2019nye zadachi marshrutizatsii i raspredeleniya zadanii: voprosy teorii","author":"AG Chentsov","year":"2008","unstructured":"Chentsov, A.G., Ekstremal\u2019nye zadachi marshrutizatsii i raspredeleniya zadanii: voprosy teorii (Extremal Problems of Routing and Task Scheduling: Theoretical Issues), Izhevsk: NITs \u201cRegulyarnaya i Khaoticheskaya Dinamika,\u201d 2008."},{"issue":"3","key":"41_CR9","first-page":"183","volume":"14","author":"AA Chentsov","year":"2008","unstructured":"Chentsov, A.A., Chentsov, A.G., and Chentsov, P.A., Extremal Problem of Routing with Internal Jobs, Tr. Inst. Mat. Mekh. Ural. Otd. Ross. Akad. Nauk, 2008, vol. 14, no. 3, pp. 183\u2013201.","journal-title":"Tr. Inst. Mat. Mekh. Ural. Otd. Ross. Akad. Nauk"},{"key":"41_CR10","first-page":"64","volume-title":"Izv. Vyssh. Uchebn. Zaved., Mat.","author":"AA Chentsov","year":"2010","unstructured":"Chentsov, A.A., Chentsov, A.G., Chentsov, P.A., Extremal Problem of Routing Motions with Constraints and Internal Losses, Izv. Vyssh. Uchebn. Zaved., Mat., 2010, no. 6, pp. 64\u201381."},{"issue":"3","key":"41_CR11","first-page":"303","volume":"423","author":"AG Chentsov","year":"2008","unstructured":"Chentsov, A.G., On Optimal Routing under Constraints, Dokl. Ross. Akad. Nauk, 2008, vol. 423, no. 3, pp. 303\u2013307.","journal-title":"Dokl. Ross. Akad. Nauk"},{"key":"41_CR12","first-page":"52","volume-title":"Izv. Ross. Akad. Nauk, Teor. Sist. Upravlen.","author":"AG Chentsov","year":"2010","unstructured":"Chentsov, A.G., Method of Dynamic Programming in the Extremal Routing Problems with Constraints, Izv. Ross. Akad. Nauk, Teor. Sist. Upravlen., 2010, no. 3, pp. 52\u201366."},{"key":"41_CR13","first-page":"68","volume-title":"Izv. Ross. Akad. Nauk, Teor. Sist. Upravlen.","author":"AN Sesekin","year":"2010","unstructured":"Sesekin, A.N., Chentsov, A.A., and Chentsov, A.G., A Generalized Courier Problem with the Cost Function Depending on The List of Tasks, Izv. Ross. Akad. Nauk, Teor. Sist. Upravlen., 2010, no. 2, pp. 68\u201377."},{"key":"41_CR14","volume-title":"Zadachi marshrutizatsii peremeshchenii","author":"AN Sesekin","year":"2011","unstructured":"Sesekin, A.N., Chentsov, A.A., and Chentsov, A.G., Zadachi marshrutizatsii peremeshchenii (Routing Problems for Movements), St. Petersburg: Lan\u2019, 2011."},{"issue":"2","key":"41_CR15","first-page":"129","volume":"14","author":"AA Chentsov","year":"2008","unstructured":"Chentsov, A.A. and Chentsov, A.G., Extremal Bottleneck Routing Problem with Constraints in the Form of Precedence Conditions, Tr. Inst. Mat. Mekh. Ural. Otd. Ross. Akad. Nauk, 2008, vol. 14, no. 2, pp. 129\u2013142.","journal-title":"Tr. Inst. Mat. Mekh. Ural. Otd. Ross. Akad. Nauk"},{"issue":"1","key":"41_CR16","first-page":"152","volume":"16","author":"AN Sesekin","year":"2010","unstructured":"Sesekin, A.N., Chentsov, A.A., and Chentsov, A.G., One Bottleneck Routing Problem, Tr. Inst. Mat. Mekh. Ural. Otd. Ross. Akad. Nauk, 2010, vol. 16, no. 1, pp. 152\u2013170.","journal-title":"Tr. Inst. Mat. Mekh. Ural. Otd. Ross. Akad. Nauk"},{"issue":"3","key":"41_CR17","first-page":"240","volume":"16","author":"AN Sesekin","year":"2010","unstructured":"Sesekin, A.N., Chentsov, A.A., and Chentsov, A.G., Routing with an Abstract Function of Travel Cost Aggregation, Tr. Inst. Mat. Mekh. Ural. Otd. Ross. Akad. Nauk, 2010, vol. 16, no. 3, pp. 240\u2013264.","journal-title":"Tr. Inst. Mat. Mekh. Ural. Otd. Ross. Akad. Nauk"},{"issue":"3","key":"41_CR18","first-page":"101","volume":"18","author":"AM Grigoriev","year":"2011","unstructured":"Grigoriev, A.M., Ivanko, E.E., and Chentsov, A.G., Dynamic Programming in a Generalized Courier Problem with Inner Tasks: Elements of a Parallel Structure, Model. Anal. Inform. Sist., 2011, vol. 18, no. 3, pp. 101\u2013124.","journal-title":"Model. Anal. Inform. Sist."},{"issue":"3","key":"41_CR19","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1134\/S0005117912030113","volume":"73","author":"AG 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":"41_CR20","first-page":"53","volume-title":"Vest. Yuzhno-Ural. Gos. Univ., Ser. Mat. Model. Progr.","author":"AG Chentsov","year":"2012","unstructured":"Chentsov, A.G., A Parallel Procedure of Constructing the Bellman Function in the Generalized Courier Problem with Interior Works, Vest. Yuzhno-Ural. Gos. Univ., Ser. Mat. Model. Progr., 2012, no. 12, pp. 53\u201375."},{"key":"41_CR21","first-page":"151","volume-title":"Izv. Inst. Mat. Informat. Udmurd. Gos. Univ.","author":"AG Chentsov","year":"2012","unstructured":"Chentsov, A.G. and Chentsov, P.A., Dynamic Programming in a Nonstationary Route Problem, Izv. Inst. Mat. Informat. Udmurd. Gos. Univ., 2012, no. 1(39), pp. 151\u2013154."},{"key":"41_CR22","first-page":"95","volume-title":"Kibern. Sist. Anal.","author":"LV Tonkov","year":"1999","unstructured":"Tonkov, L.V. and Chentsov, A.G., Problem of Optimal Choice of a Route under Conditions of Time Discounting, Kibern. Sist. Anal., 1999, no. 1, pp. 95\u2013106."},{"key":"41_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":"41_CR24","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. Translated under the title Optimal\u2019noe upravlenie differentsial\u2019nymi i funktsional\u2019nymi uravneniyami, Moscow: Nauka, 1977."},{"key":"41_CR25","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., and Stein, C., Introduction to Algorithms, Cambridge: MIT Press, 2001."},{"issue":"4","key":"41_CR26","first-page":"270","volume":"15","author":"AA Chentsov","year":"2009","unstructured":"Chentsov, A.A., Chentsov, A.G., and Chentsov, P.A., Iteration Method in the Routing Problem with Internal Losses, Tr. Inst. Mat. Mekh. Ural. Otd. Ross. Akad. Nauk, 2009, vol. 15, no. 4, pp. 270\u2013289.","journal-title":"Tr. Inst. Mat. Mekh. Ural. Otd. Ross. Akad. Nauk"},{"issue":"3","key":"41_CR27","first-page":"261","volume":"18","author":"AA Chentsov","year":"2012","unstructured":"Chentsov, A.A. and Chentsov, A.G., On an Iterative Procedure for Solving a Routing Problem with Constraints, Tr. Inst. Mat. Mekh. Ural. Otd. Ross. Akad. Nauk, 2012, vol. 18, no. 3, pp. 261\u2013281.","journal-title":"Tr. Inst. Mat. Mekh. Ural. Otd. Ross. Akad. Nauk"},{"key":"41_CR28","volume-title":"Metody marshrutizatsii i ikh prilozheniya v zadachakh povysheniya bezopasnosti i effektivnosti ekspluatatsii atomnykh stantsii","author":"VV Korobkin","year":"2012","unstructured":"Korobkin, V.V., Sesekin, A.N., Tashlykov, O.L., and Chentsov, A.G., Metody marshrutizatsii i ikh prilozheniya v zadachakh povysheniya bezopasnosti i effektivnosti ekspluatatsii atomnykh stantsii (Routing Methods and Their Applications to Safety and Efficiency Improvement Problems in Operation of Nuclear Plants), Moscow: Novye Tekhnologii, 2012."},{"key":"41_CR29","first-page":"183","volume":"2","author":"AA Chentsov","year":"2012","unstructured":"Chentsov, A.A., Chentsov, A.G., and Chentsov, P.A., Dynamic Programming in Extremal Routing Problems: General Theory and Elements of Parallel Structure, Tr. VI Mezhd. konf. \u201cParallel\u2019nye vychisleniya i zadachi upravleniya\u201d (Proc. VI Int. Conf. \u201cParallel Computing and Control Problems\u201d (PACO\u201912)), Moscow, 2012, vol. 2, pp. 183\u2013198.","journal-title":"Tr. VI Mezhd. konf. \u201cParallel\u2019nye vychisleniya i zadachi upravleniya\u201d"}],"container-title":["Automation and Remote Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0005117914030102.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0005117914030102","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1134\/S0005117914030102","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0005117914030102.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:28:10Z","timestamp":1773613690000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0005117914030102"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,3]]}},"alternative-id":["41"],"URL":"https:\/\/doi.org\/10.1134\/s0005117914030102","relation":{},"ISSN":["0005-1179","1608-3032"],"issn-type":[{"value":"0005-1179","type":"print"},{"value":"1608-3032","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3]]},"assertion":[{"value":"4 April 2013","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 March 2014","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}