{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T23:24:07Z","timestamp":1773617047175,"version":"3.50.1"},"reference-count":22,"publisher":"Pleiades Publishing Ltd","issue":"5","license":[{"start":{"date-parts":[[2021,5,1]],"date-time":"2021-05-01T00:00:00Z","timestamp":1619827200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,5,1]],"date-time":"2021-05-01T00:00:00Z","timestamp":1619827200000},"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":[[2021,5]]},"DOI":"10.1134\/s0005117921050040","type":"journal-article","created":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T09:22:54Z","timestamp":1622539374000},"page":"780-797","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Graph Methods for Solving the Unconstrained and Constrained Optimal Assignment Problem for Locomotives on a Single-Line Railway Section"],"prefix":"10.1134","volume":"82","author":[{"given":"L. Yu.","family":"Zhilyakova","sequence":"first","affiliation":[]},{"given":"N. A.","family":"Kuznetsov","sequence":"additional","affiliation":[]}],"member":"137","published-online":{"date-parts":[[2021,6,1]]},"reference":[{"key":"2126_CR1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., and Orlin, J.B., Network Flows: Theory, Algorithms, and Applications, Englewood\nCliffs: Prentice Hall, 1993."},{"key":"2126_CR2","volume-title":"Matching Theory","author":"L. Lov\u00e1sz","year":"1986","unstructured":"Lov\u00e1sz, L. and Plummer, M., Matching\nTheory, Budapest: Akad\u00e9miai Kiad\u00f3, 1986. Translated under the\ntitle: Prikladnye zadachi teorii grafov. Teoriya parosochetanii v\nmatematike, fizike, khimii, Moscow: Mir, 1998."},{"key":"2126_CR3","volume-title":"Potokovye algoritmy (Flow Algorithms)","author":"G.M. Adel\u2019son-Vel\u2019skii","year":"1975","unstructured":"Adel\u2019son-Vel\u2019skii, G.M., Dinits, E.A., and Karzanov, A.V., Potokovye\nalgoritmy (Flow Algorithms), Moscow: Nauka, 1975."},{"key":"2126_CR4","volume-title":"Algorithms in C++","author":"R. Sedgewick","year":"1992","unstructured":"Sedgewick, R., Algorithms in C++,\nBoston: Addison-Wesley, 1992. Translated under the title: Fundamental\u2019nye algoritmy na C++. Algoritmy na grafakh, St.\nPetersburg: DiaSoftYuP, 2002."},{"key":"2126_CR5","volume-title":"Grafy s nestandartnoi dostizhimost\u2019yu: zadachi, prilozheniya (Graphs with Nonstandard Reachability: Problems, Applications)","author":"Ya.M. Erusalimskii","year":"2009","unstructured":"Erusalimskii, Ya.M., Skorokhodov, V.A., Kuz\u2019minova, M.V., and Petrosyan, A.G., Grafy s nestandartnoi dostizhimost\u2019yu: zadachi, prilozheniya\n(Graphs with Nonstandard Reachability: Problems, Applications), Rostov-on-Don: Izd. Yuzhn.\nFed. Univ., 2009."},{"key":"2126_CR6","unstructured":"Erusalimskii, Ya.M., Flows in networks with nonstandard reachability,\nIzv. Vyssh. Uchebn. Zaved. Severo-Kavkaz. Region. Estestv.\nNauki, 2012, no. 1, pp. 5\u20137."},{"key":"2126_CR7","doi-asserted-by":"crossref","unstructured":"Matyukhin, V.G., Shabunin, A.B., Kuznetsov, N.A., and Takmazian, A.K.,\nRail transport control by combinatorial optimization approach, 11th\nIEEE Int. Conf. Appl. Inf. Commun. Technol. (2017), Conf. Proc., 2017, vol. 1,\npp. 419\u2013422.","DOI":"10.1109\/ICAICT.2017.8687244"},{"issue":"6","key":"2126_CR8","first-page":"94","volume":"23","author":"A.K. Takmaz\u2019yan","year":"2018","unstructured":"Takmaz\u2019yan, A.K. and Shabunin, A.B., Application of the optimal network\nflow method to the problem of locomotive selection for freight trains at the Eastern range,\nVychislit. Tekhnol., 2018, vol. 23, no. 6,\npp. 94\u2013106.","journal-title":"Vychislit. Tekhnol."},{"key":"2126_CR9","unstructured":"Zhilyakova, L.Yu., Kuznetsov, N.A., Matyukhin, V.G., Shabunin, A.B., and\nTakmaz\u2019yan, A.K., Graph model of the distribution of locomotives for freight traffic on a linear\nsection of the railway. The problem of inclusion-maximum schedule cover, Probl. Upr., 2018, no. 3, pp. 65\u201375."},{"issue":"4","key":"2126_CR10","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1287\/trsc.1050.0115","volume":"39","author":"R.K. Ahuja","year":"2005","unstructured":"Ahuja, R.K., Liu, J., Orlin, J.B., Sharma, D., and Shughart, L.A., Solving\nreal-life locomotive scheduling problems, Transp. Sci.,\n2005, vol. 39, no. 4, pp. 503\u2013517.","journal-title":"Transp. Sci."},{"key":"2126_CR11","unstructured":"Jaumard, B. and Tian, H., Multi-column generation model for the locomotive\nassignment problem, Proc. 16th Workshop Algorithmic Approaches\nTransp. Model. Optim. Syst. (ATMOS\u201916) (2016), pp. 6:1\u20136:13."},{"key":"2126_CR12","unstructured":"Azanov, V.M., Buyanov, M.V., Ivanov, S.V., Kibzun, A.I., and\nNaumov, A.V., Optimization of the locomotive fleet intended for the transportation of freight\ntrains, Tr. 3-i nauchno-tekh. konf. ISUZhT-2016  (Proc.\n3rd Sci.-Tech. Conf. ICSRT-2016) (2016), pp. 94\u201396."},{"issue":"12","key":"2126_CR13","doi-asserted-by":"publisher","first-page":"2064","DOI":"10.1134\/S0005117913120084","volume":"74","author":"A.A. Lazarev","year":"2013","unstructured":"Lazarev, A.A. and Musatova, E.G., The problem of trains formation and\nscheduling: integer statements, Autom. Remote Control,\n2013, vol. 74, no. 12, pp. 2064\u20132068.","journal-title":"Autom. Remote Control"},{"key":"2126_CR14","unstructured":"Arkhipov, D.I., Lazarev, A.A., and Musatova, E.G., Using the programming\nmethod in constraints to solve the problem of assigning locomotives and locomotive crews to\nfreight transportation, Tr. 6-i Mezhdunar. nauchno-tekh. konf.\n\u201cIntellektual\u2019nye sistemy upravleniya na zheleznodorozhnom transporte\u201d ISUZhT-2017 \n(Proc. 6th Int. Sci.-Tech. Conf. \u201cIntelligent Control Systems in Railway Transport\u201d ICSRT-2017)\n(Moscow, 2017), Moscow: OAO NIIAS, 2017, pp. 56\u201359."},{"key":"2126_CR15","doi-asserted-by":"publisher","first-page":"2217","DOI":"10.1134\/S000511791812010X","volume":"79","author":"D.N. Gainanov","year":"2018","unstructured":"Gainanov, D.N., Kibzun, A.I., and Rasskazova, V.A., The decomposition\nproblem for the set of paths in a directed graph and its application, Autom Remote Control, 2018, vol. 79,\npp. 2217\u20132236.","journal-title":"Autom Remote Control"},{"issue":"2","key":"2126_CR16","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1145\/322003.322005","volume":"24","author":"F.T. Boesch","year":"1977","unstructured":"Boesch, F.T. and Gimpel, J.F., Covering the points of digraph with\npoint-disjoint paths and its application to code optimization, J. Assoc. Comput. Mach., 1977, vol. 24, no. 2,\npp. 192\u2013198.","journal-title":"J. Assoc. Comput. Mach."},{"issue":"1","key":"2126_CR17","doi-asserted-by":"publisher","first-page":"159","DOI":"10.2140\/pjm.1975.58.159","volume":"58","author":"Sh. Noorvash","year":"1975","unstructured":"Noorvash, Sh., Covering the vertices of a graph by vertex-disjoint paths,\nPac. J. Math., 1975, vol. 58, no. 1,\npp. 159\u2013168.","journal-title":"Pac. J. Math."},{"issue":"3","key":"2126_CR18","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0012-365X(90)90130-A","volume":"84","author":"B. Jackson","year":"1990","unstructured":"Jackson, B. and Ordaz, O., Chv\u00e1tal\u2013Erd\u0151s conditions for\npaths and cycles in graphs and digraphs. A survey, Discrete\nMath., 1990, vol. 84, no. 3, pp. 241\u2013254.","journal-title":"Discrete Math."},{"key":"2126_CR19","doi-asserted-by":"crossref","unstructured":"Chv\u00e1tal, V. and Erd\u0151s, P., A note on Hamiltonian circuits,\nDiscrete Math., 1972, no. 2,\npp. 111\u2013113.","DOI":"10.1016\/0012-365X(72)90079-9"},{"key":"2126_CR20","volume-title":"Binarnye otnosheniya, grafy i kollektivnye resheniya (Binary Relations, Graphs, and Collective Decisions)","author":"F.T. Aleskerov","year":"2012","unstructured":"Aleskerov, F.T., Habina, E.L., and Schwartz, D.A., Binarnye\notnosheniya, grafy i kollektivnye resheniya (Binary Relations, Graphs, and Collective\nDecisions), Moscow: Fizmatlit, 2012."},{"key":"2126_CR21","volume-title":"Diskretnye matematicheskie modeli. Nachal\u2019nye ponyatiya i standartnye zadachi (Discrete Mathematical Models. Initial Concepts and Standard Problems)","author":"A.A. Rubchinskii","year":"2014","unstructured":"Rubchinskii, A.A., Diskretnye matematicheskie modeli. Nachal\u2019nye\nponyatiya i standartnye zadachi (Discrete Mathematical Models. Initial Concepts\nand Standard Problems), Moscow: Direkt-Media, 2014."},{"key":"2126_CR22","volume-title":"Robototekhnika i tekhnicheskaya kibernetika, No. 1 (18) (Robotics and Technical Cybernetics no. 1 (18))","author":"I.A. Kalyaev","year":"2018","unstructured":"Kalyaev, I.A. and Kapustyan, S.G., Multi-agent management method for\nsmart internet production, in Robototekhnika i tekhnicheskaya\nkibernetika, No. 1 (18) (Robotics and Technical Cybernetics no. 1 (18)), St.\nPetersburg: TsNII RTK, 2018, pp. 34\u201348."}],"container-title":["Automation and Remote Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0005117921050040.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0005117921050040","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0005117921050040.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:32:49Z","timestamp":1773613969000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0005117921050040"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5]]},"references-count":22,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2021,5]]}},"alternative-id":["2126"],"URL":"https:\/\/doi.org\/10.1134\/s0005117921050040","relation":{},"ISSN":["0005-1179","1608-3032"],"issn-type":[{"value":"0005-1179","type":"print"},{"value":"1608-3032","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5]]},"assertion":[{"value":"31 October 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 October 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 January 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 June 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}