{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:29:40Z","timestamp":1725488980601},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540699941"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69995-8_71","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T16:28:21Z","timestamp":1186763301000},"page":"445-450","source":"Crossref","is-referenced-by-count":3,"title":["Online Dial-A-Ride Problem with Time Windows: An Exact Algorithm Using Status Vectors"],"prefix":"10.1007","author":[{"given":"Anke","family":"Fabri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Recht","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"71_CR1","first-page":"3","volume-title":"Proceedings of the Symposium on Operation Research 2001","author":"M. Caramia","year":"2001","unstructured":"Caramia, M., Italiano, G. F., Oriolo, G., Pacifici, A. and Perugia, A. (2001) Routing a fleet of vehicles for dynamic combined pickup and delivery services. Proceedings of the Symposium on Operation Research 2001, pp 3\u20138. Berlin\/Heidelberg: Springer-Verlag"},{"key":"71_CR2","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.trb.2005.04.002","volume":"40","author":"A. Fabri","year":"2006","unstructured":"Fabri, A., Recht, P. (2006) On dynamic pickup and delivery vehicle routing with several time windows and waiting times. Transportation Research Part B, 40, pp335\u2013350. Elsevier","journal-title":"Transportation Research Part B"},{"key":"71_CR3","unstructured":"Fabri, A. (2006) Die Gr\u00f6\u00dfe der Statusgraphen des DARP unter Ladebedingungen. Working Paper. Universit\u00e4t Dortmund, Fachgebiet Operations Research"},{"key":"71_CR4","unstructured":"Fabri, A. (2005) Benchmarkprobleme, http:\/\/www.wiso.unidortmund.de\/orwi\/de\/content\/team\/mitarbeiter\/Benchmarks.html, 19.07.2006"},{"key":"71_CR5","doi-asserted-by":"crossref","unstructured":"P. E. Hart, N. J. Nilsson, B. Raphael: A Formal Basis for the Heuristic Determination of Minimum Cost Paths; IEEE transactions of systems science and cybernetics, Vol. 4, No.2, 1968","DOI":"10.1109\/TSSC.1968.300136"},{"key":"71_CR6","first-page":"668","volume-title":"Commun. ACM","author":"W. Pugh","year":"1990","unstructured":"Pugh, William (1990) Skip lists: a probabilistic alternative to balanced trees. Commun. ACM, vol. 33 nr. 6ACM Press, pp. 668\u2013676. New York: ACM Press"}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2006"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69995-8_71.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:06:33Z","timestamp":1605762393000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69995-8_71"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540699941"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69995-8_71","relation":{},"subject":[]}}