{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T22:27:57Z","timestamp":1768516077083,"version":"3.49.0"},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1974,12,1]],"date-time":"1974-12-01T00:00:00Z","timestamp":155088000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1974,12]]},"DOI":"10.1007\/bf01585517","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:09:11Z","timestamp":1114679351000},"page":"212-222","source":"Crossref","is-referenced-by-count":168,"title":["Implementation and efficiency of Moore-algorithms for the shortest route problem"],"prefix":"10.1007","volume":"7","author":[{"given":"U.","family":"Pape","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1287\/opre.17.3.395","volume":"17","author":"S.E. Dreyfus","year":"1969","unstructured":"S.E. Dreyfus, \u201cAn appraisal of some shortest path algorithms\u201d,Operations Research 17 (1969) 395\u2013412.","journal-title":"Operations Research"},{"key":"CR2","volume-title":"Proceedings of an international symposium on the theory of switching, Part II, Apr. 2\u20135, 1957","author":"E.F. Moore","year":"1959","unstructured":"E.F. Moore, \u201cThe shortest path through a maze\u201d, in:Proceedings of an international symposium on the theory of switching, Part II, Apr. 2\u20135, 1957 (Harvard University Press, Cambridge, Ma., 1959)."},{"key":"CR3","unstructured":"U. Pape, \u201cNetzwerkver\u00e4nderungen und Korrektur k\u00fcrzester Wegl\u00e4ngen von einer Wurzelmenge zu allen anderen Knoten\u201d, Technical University of Berlin, Department of Cybernetics, Tech. Rept. 73-17."},{"key":"CR4","unstructured":"U. Pape, \u201cImplementierung und Wirtschaftlichkeit von Moore-Algorithmen zur Bestimmung k\u00fcrzester Wegl\u00e4ngen in einem Netzwerk\u201d, Technical University of Berlin, Department of Cybernetics, Tech. Rept. 73-06."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1287\/opre.8.2.224","volume":"8","author":"M. Pollack","year":"1960","unstructured":"M. Pollack and W. Wiebenson, \u201cSolutions of the shortest route problem \u2014 a review\u201d,Operations Research 8 (1960) 224\u2013230.","journal-title":"Operations Research"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01585517.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01585517\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01585517","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:32:28Z","timestamp":1556897548000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01585517"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974,12]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1974,12]]}},"alternative-id":["BF01585517"],"URL":"https:\/\/doi.org\/10.1007\/bf01585517","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1974,12]]}}}