{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T22:31:33Z","timestamp":1768343493023,"version":"3.49.0"},"reference-count":21,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1988,1,1]],"date-time":"1988-01-01T00:00:00Z","timestamp":567993600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[1988,1]]},"DOI":"10.1016\/0305-0548(88)90052-4","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"567-576","source":"Crossref","is-referenced-by-count":39,"title":["A computational study of efficient shortest path algorithms"],"prefix":"10.1016","volume":"15","author":[{"given":"Ming S.","family":"Hung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James J.","family":"Divoky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(88)90052-4_BIB1","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","year":"1976"},{"key":"10.1016\/0305-0548(88)90052-4_BIB2","series-title":"Data Structures and Network Algorithms","author":"Tarjan","year":"1983"},{"key":"10.1016\/0305-0548(88)90052-4_BIB3","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1287\/opre.17.3.395","article-title":"An appraisal of some shortest-path algorithms","volume":"17","author":"Dreyfus","year":"1969","journal-title":"Opns Res."},{"key":"10.1016\/0305-0548(88)90052-4_BIB4","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1002\/net.3230140206","article-title":"Shortest-path methods: complexity, inter-relations and new propositions","volume":"14","author":"Pallottino","year":"1984","journal-title":"Networks"},{"key":"10.1016\/0305-0548(88)90052-4_BIB5","doi-asserted-by":"crossref","DOI":"10.6028\/NBS.TN.772","article-title":"A performance comparison of labeling algorithms for calculating shortest path trees","author":"Gilsinn","year":"1973"},{"key":"10.1016\/0305-0548(88)90052-4_BIB6","doi-asserted-by":"crossref","first-page":"1164","DOI":"10.1287\/opre.24.6.1164","article-title":"Shortest path algorithms: a comparison","volume":"24","author":"Golden","year":"1976","journal-title":"Opns Res."},{"key":"10.1016\/0305-0548(88)90052-4_BIB7","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1287\/opre.27.1.161","article-title":"Shortest-route methods. 1. Reaching, pruning, and buckets","volume":"27","author":"Denardo","year":"1979","journal-title":"Opns Res."},{"key":"10.1016\/0305-0548(88)90052-4_BIB8","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1002\/net.3230090304","article-title":"A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees","volume":"9","author":"Dial","year":"1979","journal-title":"Networks"},{"key":"10.1016\/0305-0548(88)90052-4_BIB9","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1002\/net.3230140103","article-title":"Computational study of an improved shortest path algorithm","volume":"14","author":"Glover","year":"1984","journal-title":"Networks"},{"key":"10.1016\/0305-0548(88)90052-4_BIB10","doi-asserted-by":"crossref","first-page":"1106","DOI":"10.1287\/mnsc.31.9.1106","article-title":"New polynomial shortest path algorithms and their computational attributes","volume":"31","author":"Glover","year":"1985","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(88)90052-4_BIB11","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connexion with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Num. Math."},{"key":"10.1016\/0305-0548(88)90052-4_BIB12","volume":"Vol. 3","author":"Knuth","year":"1973"},{"key":"10.1016\/0305-0548(88)90052-4_BIB13","doi-asserted-by":"crossref","unstructured":"M. L. Fredman and R. E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms. IEEE Found. Comput. Sci., pp. 338\u2013357.","DOI":"10.1109\/SFCS.1984.715934"},{"key":"10.1016\/0305-0548(88)90052-4_BIB14","first-page":"632","article-title":"Algorithm 360 shortest path forest with topological ordering","volume":"12","author":"Dial","year":"1969","journal-title":"Communs Ass. Comput. Mach."},{"key":"10.1016\/0305-0548(88)90052-4_BIB15","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1287\/opre.33.1.65","article-title":"A new polynomially bounded shortest path algorithm","volume":"33","author":"Glover","year":"1985","journal-title":"Opns Res."},{"key":"10.1016\/0305-0548(88)90052-4_BIB16","series-title":"Simulation Modeling and Analysis","author":"Law","year":"1982"},{"key":"10.1016\/0305-0548(88)90052-4_BIB17","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/net.3230110407","article-title":"A shortest augmenting path method for solving minimal perfect matching problems","volume":"11","author":"Derigs","year":"1981","journal-title":"Networks"},{"key":"10.1016\/0305-0548(88)90052-4_BIB18","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","article-title":"Theoretical improvements in algorithmic efficiency for network flow problems","volume":"19","author":"Edmonds","year":"1972","journal-title":"J. Ass. Comput. Mach."},{"key":"10.1016\/0305-0548(88)90052-4_BIB19","article-title":"Shortest paths: a bibliography","author":"Gallo","year":"1982","journal-title":"SOFTMAT Document 81-P1-4-SOFTMAT-27"},{"key":"10.1016\/0305-0548(88)90052-4_BIB20","article-title":"The Pr\u00fcfer code for bipartite graphs","author":"Hung","year":"1984"},{"key":"10.1016\/0305-0548(88)90052-4_BIB21","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1016\/0305-0548(86)90075-4","article-title":"Network generation using the Pr\u00fcfer code","volume":"13","author":"Murphy","year":"1986","journal-title":"Comput. Opns Res."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054888900524?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054888900524?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T03:05:12Z","timestamp":1734059112000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054888900524"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,1]]},"references-count":21,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1988,1]]}},"alternative-id":["0305054888900524"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(88)90052-4","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1988,1]]}}}