{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:52:37Z","timestamp":1773615157862,"version":"3.50.1"},"reference-count":15,"publisher":"Allerton Press","issue":"7","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":["Aut. Control Comp. Sci."],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.3103\/s0146411618070234","type":"journal-article","created":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T07:04:17Z","timestamp":1551683057000},"page":"625-633","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["The Shortest Path Problem for a Multiple Graph"],"prefix":"10.3103","volume":"52","author":[{"given":"A. V.","family":"Smirnov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1627","published-online":{"date-parts":[[2019,3,4]]},"reference":[{"key":"7030_CR1","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., and Stein, C., Introduction to Algorithms, The MIT Press, McGraw-Hill Book Company, 2009, 3rd ed."},{"key":"7030_CR2","volume-title":"Graphs and Hypergraphs","author":"C. Berge","year":"1973","unstructured":"Berge, C., Graphs and Hypergraphs, North-Holland Publishing Company, 1973."},{"key":"7030_CR3","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0167-9236(99)00006-8","volume":"25","author":"A. Basu","year":"1999","unstructured":"Basu, A. and Blanning, R.W., Metagraphs in workflow support systems, Decis. Support Syst., 1999, vol. 25, no. 3, pp. 199\u2013208.","journal-title":"Decis. Support Syst."},{"key":"7030_CR4","unstructured":"Basu, A. and Blanning, R.W., Metagraphs and their applications, in Integrated Series in Information Systems, Springer US, 2007, vol. 15."},{"key":"7030_CR5","first-page":"60","volume":"3","author":"V.S. Rublev","year":"2011","unstructured":"Rublev, V.S. and Smirnov, A.V., Flows in multiple networks, Yarosl. Pedagog. Vestn., 2011, vol. 3, no. 2, pp. 60\u201368.","journal-title":"Yarosl. Pedagog. Vestn."},{"key":"7030_CR6","doi-asserted-by":"publisher","first-page":"527","DOI":"10.3103\/S0146411616070191","volume":"50","author":"A.V. Smirnov","year":"2016","unstructured":"Smirnov, A.V., The problem of finding the maximum multiple flow in the divisible network and its special cases, Autom. Control Comput. Sci., 2016, vol. 50, no. 7, pp. 527\u2013535.","journal-title":"Autom. Control Comput. Sci."},{"key":"7030_CR7","volume-title":"Flows in Networks","author":"L.R. Ford","year":"1962","unstructured":"Ford, L.R. and Fulkerson, D.R., Flows in Networks, Princeton University Press, 1962."},{"key":"7030_CR8","first-page":"72","volume":"17","author":"V.S. Roublev","year":"2010","unstructured":"Roublev, V.S. and Smirnov, A.V., The problem of integer-valued balancing of a three-dimensional matrix and algorithms of its solution, Model. Anal. Inf. Syst., 2010, vol. 17, no. 2, pp. 72\u201398.","journal-title":"Model. Anal. Inf. Syst."},{"key":"7030_CR9","doi-asserted-by":"publisher","first-page":"543","DOI":"10.3103\/S0146411614070293","volume":"48","author":"A.V. Smirnov","year":"2014","unstructured":"Smirnov, A.V., Some solvability classes for the problem of integer balancing of a three-dimensional matrix with constraints of the second type, Autom. Control Comput. Sci., 2014, vol. 48, no. 7, pp. 543\u2013553.","journal-title":"Autom. Control Comput. Sci."},{"key":"7030_CR10","doi-asserted-by":"publisher","first-page":"466","DOI":"10.18255\/1818-1015-2016-4-466-478","volume":"23","author":"A.V. Smirnov","year":"2016","unstructured":"Smirnov, A.V., Network model for the problem of integer balancing of a four-dimensional matrix, Model. Anal. Inf. Syst., 2016, vol. 23, no. 4, pp. 466\u2013478.","journal-title":"Model. Anal. Inf. Syst."},{"key":"7030_CR11","unstructured":"Korbut, A.A. and Finkelstein, J.J., Diskretnoe programmirovanie (Discrete Programming), Moscow: Nauka, 1969."},{"key":"7030_CR12","unstructured":"Raskin, L.G. and Kirichenko, I.O., Mnogoindeksnye zadachi lineinogo programmirovaniya (Multi-Index Problems of Linear Programming), Moscow: Radio i svyaz, 1982."},{"key":"7030_CR13","series-title":"Multi index assignment problems: Complexity, approximation, applications","volume-title":"Nonlinear Assignment Problems. Algorithms and Applications","author":"F.C.R. Spieksma","year":"2000","unstructured":"Spieksma, F.C.R., Multi index assignment problems: Complexity, approximation, applications, in Nonlinear Assignment Problems. Algorithms and Applications, Pardalos, P.M. and Pitsoulis, L.S., Eds., Kluwer Academic Publishers, 2000, pp. 1\u201311."},{"key":"7030_CR14","doi-asserted-by":"publisher","first-page":"912","DOI":"10.1134\/S1064562410060190","volume":"82","author":"V.S. Roublev","year":"2010","unstructured":"Roublev, V.S. and Smirnov, A.V., NP-completeness of the integer balancing problem for a three-dimensional matrix, Dokl. Math., 2010, vol. 82, no. 3, pp. 912\u2013914.","journal-title":"Dokl. Math."},{"key":"7030_CR15","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W., A note on two problems in connexion with graphs, Numer. Math., 1959, vol. 1, no. 1, pp. 269\u2013271.","journal-title":"Numer. Math."}],"container-title":["Automatic Control and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411618070234.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.3103\/S0146411618070234","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411618070234.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T21:56:07Z","timestamp":1773611767000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.3103\/S0146411618070234"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12]]},"references-count":15,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["7030"],"URL":"https:\/\/doi.org\/10.3103\/s0146411618070234","relation":{},"ISSN":["0146-4116","1558-108X"],"issn-type":[{"value":"0146-4116","type":"print"},{"value":"1558-108X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,12]]},"assertion":[{"value":"23 August 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 March 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}