{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,15]],"date-time":"2023-11-15T08:16:34Z","timestamp":1700036194939},"reference-count":8,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,3,1]],"date-time":"1991-03-01T00:00:00Z","timestamp":667785600000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[1991,3]]},"DOI":"10.1016\/0167-6377(91)90088-7","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T18:40:45Z","timestamp":1056998445000},"page":"61-65","source":"Crossref","is-referenced-by-count":4,"title":["On the equivalence between some shortest path algorithms"],"prefix":"10.1016","volume":"10","author":[{"given":"Hanif D.","family":"Sherali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(91)90088-7_BIB1","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","article-title":"On a routing problem","volume":"16","author":"Bellman","year":"1959","journal-title":"Quart. Appl. Math."},{"key":"10.1016\/0167-6377(91)90088-7_BIB2","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\/0167-6377(91)90088-7_BIB3","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":"Oper. Res."},{"issue":"6","key":"10.1016\/0167-6377(91)90088-7_BIB4","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1016\/0305-0548(88)90052-4","article-title":"A computational study of efficient shortest path algorithms","volume":"15","author":"Hung","year":"1988","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/0167-6377(91)90088-7_BIB5","series-title":"Proceedings of the International Symposium on Theory of Switching Part II, 1959","article-title":"The shortest path through a maze","volume":"30","author":"Moore","year":"1957"},{"key":"10.1016\/0167-6377(91)90088-7_BIB6","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/BF01585517","article-title":"Implementation and efficiency of Moore-algorithms for the shortest route problem","volume":"7","author":"Pape","year":"1974","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(91)90088-7_BIB7","doi-asserted-by":"crossref","first-page":"317","DOI":"10.6028\/jres.086.013","article-title":"Properties of labeling methods for determining shortest path trees","volume":"86","author":"Shier","year":"1981","journal-title":"J. Res. Nat. Bur. Standards"},{"key":"10.1016\/0167-6377(91)90088-7_BIB8","series-title":"Dynamic Programming","author":"White","year":"1969"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637791900887?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637791900887?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T09:26:44Z","timestamp":1552901204000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167637791900887"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,3]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,3]]}},"alternative-id":["0167637791900887"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(91)90088-7","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1991,3]]}}}