{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:09:48Z","timestamp":1773655788354,"version":"3.50.1"},"reference-count":5,"publisher":"Allerton Press","issue":"7","license":[{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"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":[[2024,12]]},"DOI":"10.3103\/s0146411624700226","type":"journal-article","created":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T14:48:36Z","timestamp":1739371716000},"page":"745-752","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Optimized Algorithm of Finding the Shortest Path in a Multiple Graph"],"prefix":"10.3103","volume":"58","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0980-2507","authenticated-orcid":false,"given":"A. V.","family":"Smirnov","sequence":"first","affiliation":[]}],"member":"1627","published-online":{"date-parts":[[2025,2,12]]},"reference":[{"key":"7743_CR1","doi-asserted-by":"publisher","first-page":"625","DOI":"10.3103\/s0146411618070234","volume":"52","author":"A.V. Smirnov","year":"2018","unstructured":"Smirnov, A.V., The shortest path problem for a multiple graph, Autom. Control Comput. Sci., 2018, vol. 52, no.\u00a07, pp. 625\u2013633. https:\/\/doi.org\/10.3103\/s0146411618070234","journal-title":"Autom. Control Comput. Sci."},{"key":"7743_CR2","doi-asserted-by":"publisher","first-page":"841","DOI":"10.3103\/S0146411623070143","volume":"57","author":"A.V. Smirnov","year":"2023","unstructured":"Smirnov, A.V., The polynomial algorithm of finding the shortest path in a divisible multiple graph, Autom. Control Comput. Sci., 2023, vol. 57, no. 7, pp. 841\u2013853. https:\/\/doi.org\/10.3103\/S0146411623070143","journal-title":"Autom. Control Comput. Sci."},{"key":"7743_CR3","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, Numerische Math., 1959, vol. 1, no. 1, pp.\u00a0269\u2013271. https:\/\/doi.org\/10.1007\/bf01386390","journal-title":"Numerische Math."},{"key":"7743_CR4","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"H.W. Kuhn","year":"1955","unstructured":"Kuhn, H.W., The Hungarian method for the assignment problem, Naval Res. Logist. Q., 1955, vol. 2, nos. 1\u20132, pp. 83\u201397. https:\/\/doi.org\/10.1002\/nav.3800020109","journal-title":"Naval Res. Logist. Q."},{"key":"7743_CR5","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1137\/0105003","volume":"5","author":"J. Munkres","year":"1957","unstructured":"Munkres, J., Algorithms for the assignment and transportation problems, J. Soc. Ind. Appl. Math., 1957, vol. 5, no. 1, pp. 32\u201338. https:\/\/doi.org\/10.1137\/0105003","journal-title":"J. Soc. Ind. Appl. Math."}],"container-title":["Automatic Control and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411624700226.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.3103\/S0146411624700226","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411624700226.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:06:38Z","timestamp":1773612398000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.3103\/S0146411624700226"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12]]},"references-count":5,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["7743"],"URL":"https:\/\/doi.org\/10.3103\/s0146411624700226","relation":{},"ISSN":["0146-4116","1558-108X"],"issn-type":[{"value":"0146-4116","type":"print"},{"value":"1558-108X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12]]},"assertion":[{"value":"18 January 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 February 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 February 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 February 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The author of this work declares that he has no conflicts of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"CONFLICT OF INTEREST"}}]}}