{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:16:03Z","timestamp":1725664563818},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602200"},{"type":"electronic","value":"9783540447474"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60220-8_72","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:53:09Z","timestamp":1330278789000},"page":"303-314","source":"Crossref","is-referenced-by-count":0,"title":["Routing with delays when storage is costly"],"prefix":"10.1007","author":[{"given":"Sanjoy","family":"Baruah","sequence":"first","affiliation":[]},{"given":"Gara","family":"Pruesse","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"27_CR1","volume-title":"Ph.D thesis","author":"R. Ahmadi","year":"1988","unstructured":"R. Ahmadi. Scheduling in just-in-time manufacture. Ph.D thesis. The University of Texas, Austin, TX. 1988."},{"key":"27_CR2","unstructured":"N. Christofides. Worst-case analysis of a new heuristic for the traveling salesman problem. Technical report, GSIA, Carnegie-Mellon University, 1976."},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E. W. Dijkstra","year":"1959","unstructured":"E. W. Dijkstra. A note on two problems in connection with graphs. Numer. Math., 1:269\u2013271, 1959.","journal-title":"Numer. Math."},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"R. W. Floyd","year":"1962","unstructured":"R. W. Floyd. Algorithm 97: Shortest path. Comm. ACM, 5:345, 1962.","journal-title":"Comm. ACM"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"F. Preparata and M. Shamos. Computational Geometry: An Introduction. Springer-Verlag, 1985.","DOI":"10.1007\/978-1-4612-1098-6"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"H. Psaraftis and J. Tsitsiklis. Dynamic shortest paths in acyclic networks with Markovian arc costs. Operations Research:14(1). 1993.","DOI":"10.1287\/opre.41.1.91"},{"key":"27_CR7","unstructured":"V. Vazirani. Personal communication. July 1994."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60220-8_72.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:33:48Z","timestamp":1619573628000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60220-8_72"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602200","9783540447474"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-60220-8_72","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}