{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T23:25:30Z","timestamp":1649201130607},"reference-count":7,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"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":[[2003,7]]},"DOI":"10.1016\/s0305-0548(02)00067-9","type":"journal-article","created":{"date-parts":[[2003,2,17]],"date-time":"2003-02-17T13:07:53Z","timestamp":1045487273000},"page":"1187-1217","source":"Crossref","is-referenced-by-count":3,"title":["Visiting a network of services with time constraints"],"prefix":"10.1016","volume":"30","author":[{"given":"Monica","family":"Gentili","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0305-0548(02)00067-9_BIB1","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0305-0548(83)90030-8","article-title":"Routing and scheduling of vehicles and crews. The state of the art","volume":"10","author":"Bodin","year":"1983","journal-title":"Computers and Operation Research"},{"key":"10.1016\/S0305-0548(02)00067-9_BIB2","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0191-2615(99)00023-5","article-title":"Shortest path in traffic light networks","volume":"34","author":"Chen","year":"2000","journal-title":"Transportation Research Part B"},{"issue":"3","key":"10.1016\/S0305-0548(02)00067-9_BIB3","first-page":"191","article-title":"A generalised permanent labelling algorithm for the shortest path problem with time windows","volume":"26","author":"Desrochers","year":"1988","journal-title":"INFOR"},{"issue":"2","key":"10.1016\/S0305-0548(02)00067-9_BIB4","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1287\/opre.35.2.266","article-title":"Vehicle routing with time windows","volume":"35","author":"Kolen","year":"1987","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(02)00067-9_BIB5","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF02098290","article-title":"Routing problems: a bibliography","volume":"61","author":"Laporte","year":"1995","journal-title":"Annals of Operations Research"},{"issue":"1\u20134","key":"10.1016\/S0305-0548(02)00067-9_BIB6","first-page":"3","article-title":"Shortest path algorithms","volume":"13","author":"Gallo","year":"1988","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0305-0548(02)00067-9_BIB7","unstructured":"Garey MR, Johnson DS. Computer and intractability. A guide to the theory of NP-completeness. New York: Freeman, 1979."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054802000679?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054802000679?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T11:29:21Z","timestamp":1555154961000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054802000679"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":7,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["S0305054802000679"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(02)00067-9","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}