{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,5,16]],"date-time":"2022-05-16T22:05:17Z","timestamp":1652738717905},"reference-count":2,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1969,3,1]],"date-time":"1969-03-01T00:00:00Z","timestamp":-26438400000},"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":["Automatica"],"published-print":{"date-parts":[[1969,3]]},"DOI":"10.1016\/0005-1098(69)90010-7","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T13:29:05Z","timestamp":1047648545000},"page":"167-173","source":"Crossref","is-referenced-by-count":3,"title":["Traffic flow information for minimum cost routing procedures"],"prefix":"10.1016","volume":"5","author":[{"suffix":"Jr.","given":"B.","family":"Yaged","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0005-1098(69)90010-7_BIB1","doi-asserted-by":"crossref","DOI":"10.21236\/AD0646551","article-title":"All shortest routes in a graph","author":"Dantzig","year":"1966"},{"key":"10.1016\/0005-1098(69)90010-7_BIB2","article-title":"A decomposition algorithm for shortest paths in a network","author":"Hu","year":"1967"}],"container-title":["Automatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0005109869900107?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0005109869900107?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T00:25:05Z","timestamp":1553646305000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0005109869900107"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1969,3]]},"references-count":2,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1969,3]]}},"alternative-id":["0005109869900107"],"URL":"https:\/\/doi.org\/10.1016\/0005-1098(69)90010-7","relation":{},"ISSN":["0005-1098"],"issn-type":[{"value":"0005-1098","type":"print"}],"subject":[],"published":{"date-parts":[[1969,3]]}}}