{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:19:04Z","timestamp":1773656344347,"version":"3.50.1"},"reference-count":20,"publisher":"Pleiades Publishing Ltd","issue":"12","license":[{"start":{"date-parts":[[2018,12,1]],"date-time":"2018-12-01T00:00:00Z","timestamp":1543622400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,12,1]],"date-time":"2018-12-01T00:00:00Z","timestamp":1543622400000},"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":[[2018,12]]},"DOI":"10.1134\/s000511791812010x","type":"journal-article","created":{"date-parts":[[2018,12,13]],"date-time":"2018-12-13T00:30:09Z","timestamp":1544661009000},"page":"2217-2236","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["The Decomposition Problem for the Set of Paths in a Directed Graph and Its Application"],"prefix":"10.1134","volume":"79","author":[{"given":"D. N.","family":"Gainanov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. I.","family":"Kibzun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V. A.","family":"Rasskazova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"137","published-online":{"date-parts":[[2018,12,13]]},"reference":[{"issue":"2","key":"904_CR1","first-page":"14","volume":"49","author":"A.A. Lazarev","year":"2009","unstructured":"Lazarev, A.A., Absolute Error Estimates and an Approximate Solution Scheme for Scheduling Theory Problems, Zh. Vychisl. Mat. Mat. Fiz., 2009, vol. 49, no. 2, pp. 14\u201334.","journal-title":"Zh. Vychisl. Mat. Mat. Fiz."},{"key":"904_CR2","volume-title":"Teoriya raspisanii. Zadachi zheleznodorozhnogo planirovaniya (Scheduling Theory. Railroad Planning Problems)","author":"A.A. Lazarev","year":"2012","unstructured":"Lazarev, A.A., Musatova, E.G., Gafarov, E.R., and Kvaratskheliya, A.G., Teoriya raspisanii. Zadachi zheleznodorozhnogo planirovaniya (Scheduling Theory. Railroad Planning Problems), Moscow: Inst. Probl. Upravlen., RAN, 2012."},{"key":"904_CR3","first-page":"161","volume":"38","author":"A.A. Lazarev","year":"2012","unstructured":"Lazarev, A.A. and Musatova, E.G., Integer-Valued Settings of the Problem of Constructing Railroad Trains and Their Schedules, Upravlen. Bol\u2019shimi Sist., 2012, no. 38, pp. 161\u2013169.","journal-title":"Upravlen. Bol\u2019shimi Sist."},{"issue":"3","key":"904_CR4","doi-asserted-by":"publisher","first-page":"17","DOI":"10.14529\/mmp160302","volume":"9","author":"D.N. Gainanov","year":"2016","unstructured":"Gainanov, D.N. and Rasskazova, V.A., An Inference Algorithm for Monotone Boolean Functions Associated with Undirected Graphs, Bull. SUSU, 2016, no. 9 (3), pp. 17\u201330.","journal-title":"Bull. SUSU"},{"issue":"14","key":"904_CR5","first-page":"307","volume":"4","author":"N.A. Kuznetsov","year":"2014","unstructured":"Kuznetsov, N.A., Pashchenko, F.F., Ryabykh, N.G., Zakharova, E.M., and Minashina, I.K., Optimization Algorithms in Planning Problem on Rail Transport, Inform. Prots., 2014, no. 4 (14), pp. 307\u2013318.","journal-title":"Optimization Algorithms in Planning Problem on Rail Transport, Inform. Prots."},{"key":"904_CR6","first-page":"110","volume":"1","author":"A.K. Takmaz\u2019yan","year":"2015","unstructured":"Takmaz\u2019yan, A.K. and Sheludyakov, A.V., A Multiagent Solution with the Method of Auctions for a Multiproduct Transportation Problem with United Needs, ISUZhT, 2015, no. 1, pp. 110\u2013112.","journal-title":"ISUZhT"},{"key":"904_CR7","volume-title":"Intl. Trans. Op. Res.","author":"F. Piu","year":"2014","unstructured":"Piu, F. and Speranza, M.G., The Locomotive Assignment Problem: A Survey on Optimization Models, Intl. Trans. Op. Res., 2014, 21, pp. 327\u2013352."},{"key":"904_CR8","first-page":"73","volume":"9","author":"V.M. Azanov","year":"2016","unstructured":"Azanov, V.M., Buyanov, M.V., Gainanov, D.N., and Ivanov, S.V., Algorithms and Software for Locomotive Assignment Intended to Transport Freight Trains, Vestn. YuUrGU, Ser. Mat. Modelir. Programmir., 2016, no. 9, pp. 73\u201385.","journal-title":"Vestn. YuUrGU, Ser. Mat. Modelir. Programmir."},{"issue":"11","key":"904_CR9","doi-asserted-by":"publisher","first-page":"1944","DOI":"10.1134\/S0005117916110059","volume":"77","author":"S.V. Ivanov","year":"2016","unstructured":"Ivanov, S.V., Kibzun, A.I., and Osokin, A.V., Stochastic Optimization Model of Locomotive Assignment to Freight Trains, Autom. Remote Control, 2016, vol. 77, no. 11, pp. 1944\u20131956.","journal-title":"Autom. Remote Control"},{"key":"904_CR10","volume-title":"Graph DynamicalModel for the Problem of Assigning Tractional Resources for Freight Railroad Transportation","author":"V.G. Matyukhin","year":"2017","unstructured":"Matyukhin, V.G., Kuznetsov, N.A., Shabunin, A.B., Zhilyakova, L.Yu., and Takmaz\u2019yan, A.K., Graph DynamicalModel for the Problem of Assigning Tractional Resources for Freight Railroad Transportation, ISUZhT, 2017, Moscow: AO \u201cNIIAS,\u201d 2017, pp. 14\u201318."},{"issue":"11","key":"904_CR11","doi-asserted-by":"publisher","first-page":"1928","DOI":"10.1134\/S0005117916110047","volume":"77","author":"D.N. Gainanov","year":"2016","unstructured":"Gainanov, D.N., Konygin, A.V., and Rasskazova, V.A., Modelling Railway Freight Traffic Using the Methods of Graph Theory and Combinatorial Optimization, Autom. Remote Control, 2016, vol. 77, no. 11, pp. 1928\u20131943.","journal-title":"Autom. Remote Control"},{"key":"904_CR12","first-page":"419","volume":"1","author":"V.G. Matyukhin","year":"2017","unstructured":"Matyukhin, V.G., Shabunin, A.B., Kuznetsov, N.A., and Takmazian, A.K., Rail Transport Control by Combinatorial Optimization Approach, 11th Int. Conf. on Application of Information and Communication Technologies, 2017, no. 1, pp. 419\u2013422.","journal-title":"11th Int. Conf. on Application of Information and Communication Technologies"},{"key":"904_CR13","first-page":"51","volume":"5","author":"D.N. Gainanov","year":"2017","unstructured":"Gainanov, D.N., Kibzun, A.I., and Rasskazova, V.A., Vertex Cover Algorithm for a Directed Graph with a Set of Directed Paths in the Optimal Assignment and Locomotive Moving Problem, Vestn. Komp. Informats. Tekhn., 2017, no. 5, pp. 51\u201356.","journal-title":"Vestn. Komp. Informats. Tekhn."},{"issue":"3","key":"904_CR14","first-page":"126","volume":"1","author":"R.I. Tyshkevich","year":"2011","unstructured":"Tyshkevich, R.I., Suzdal\u2019, S.V., Maksimovich, O.V., and Petrovich, R.A., Algebraic Theory of Graph Decomposition, Vestn. BSU, 2011, no. 1 (3), pp. 126\u2013138.","journal-title":"Vestn. BSU"},{"key":"904_CR15","volume-title":"Algorithms","author":"S. Dasgupta","year":"2006","unstructured":"Dasgupta, S., Papadimitriou, C., and Vazirani, U., Algorithms, Columbus: McGraw-Hill, 2006. Translated under the title Algoritmy, Moscow: MTsNMO, 2014."},{"key":"904_CR16","volume-title":"Combinatorial Optimization: Theory and Algorithms","author":"B. Korte","year":"2010","unstructured":"Korte, B. and Vygen, J., Combinatorial Optimization: Theory and Algorithms, New York: Springer, 2010. Translated under the title Kombinatornaya optimizatsiya. Teoriya i algoritmy, Moscow: MTsNMO, 2015."},{"key":"904_CR17","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1021\/ci990262o","volume":"40","author":"E. Gardiner","year":"2000","unstructured":"Gardiner, E., Willett, P., and Artymiuk, P., Graph-Theoretic Techniques for Macromolecular Docking, J. Chem. Inf. Comput., 2000, no. 40, pp. 273\u2013279.","journal-title":"J. Chem. Inf. Comput."},{"issue":"5","key":"904_CR18","first-page":"36","volume":"1","author":"V.V. Bykova","year":"2012","unstructured":"Bykova, V.V., On a Decomposition of a Hypergraph by Minimal Clique Separators, Zh. Sib. Federal. Univ., 2012, no. 1 (5), pp. 36\u201345.","journal-title":"Zh. Sib. Federal. Univ."},{"key":"904_CR19","volume-title":"Graph Theory, London: Addison Wesley","author":"F. Harary","year":"1976","unstructured":"Harary, F., Graph Theory, London: Addison Wesley, 1969. Translated under the title Teoriya grafov, Moscow: Mir, 1976."},{"key":"904_CR20","volume-title":"Graph Theory. An Algorithmic Approach","author":"N. Christofides","year":"1978","unstructured":"Christofides, N., Graph Theory. An Algorithmic Approach, New York: Academic, 1975. Translated under the title Teoriya grafov. Algoritmicheskii podkhod, Moscow: Mir, 1978."}],"container-title":["Automation and Remote Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S000511791812010X.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S000511791812010X","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S000511791812010X.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:35:17Z","timestamp":1773614117000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S000511791812010X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12]]},"references-count":20,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["904"],"URL":"https:\/\/doi.org\/10.1134\/s000511791812010x","relation":{},"ISSN":["0005-1179","1608-3032"],"issn-type":[{"value":"0005-1179","type":"print"},{"value":"1608-3032","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,12]]},"assertion":[{"value":"31 January 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 December 2018","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}