{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:43:18Z","timestamp":1725489798461},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540739487"},{"type":"electronic","value":"9783540739517"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73951-7_52","type":"book-chapter","created":{"date-parts":[[2007,8,20]],"date-time":"2007-08-20T10:18:03Z","timestamp":1187605083000},"page":"601-612","source":"Crossref","is-referenced-by-count":0,"title":["On Euclidean Vehicle Routing with Allocation"],"prefix":"10.1007","author":[{"given":"Jan","family":"Remy","sequence":"first","affiliation":[]},{"given":"Reto","family":"Sp\u00f6hel","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Wei\u00dfl","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"52_CR1","first-page":"1","volume-title":"Advances in Discrete and Computational Geometry, Contemporary Mathematics","author":"P.K. Agarwal","year":"1999","unstructured":"Agarwal, P.K., Erickson, J.: Geometric range searching and its relatives. In: Chazelle, B., Goodman, J.E., Pollack, R. (eds.) Advances in Discrete and Computational Geometry, Contemporary Mathematics, vol.\u00a0223, pp. 1\u201356. American Mathematical Socienty, Providence, RI (1999)"},{"key":"52_CR2","doi-asserted-by":"crossref","unstructured":"Armon, A., Avidor, A., Schwartz, O.: Cooperative TSP. In: Proceedings of the 14th Annual European Symposium on Algorithms, pp. 40\u201351 (2006)","DOI":"10.1007\/11841036_7"},{"issue":"5","key":"52_CR3","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1145\/290179.290180","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S.: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. Journal of the ACM\u00a045(5), 753\u2013782 (1998)","journal-title":"Journal of the ACM"},{"key":"52_CR4","doi-asserted-by":"crossref","unstructured":"Arora, S., Raghavan, P., Rao, S.: Approximation schemes for Euclidean k-medians and related problems. In: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pp. 106\u2013113 (1998)","DOI":"10.1145\/276698.276718"},{"key":"52_CR5","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF02568604","volume":"4","author":"J.E. Beasley","year":"1996","unstructured":"Beasley, J.E., Nascimento, E.: The vehicle routing allocation problem: a unifying framework. TOP\u00a04, 65\u201386 (1996)","journal-title":"TOP"},{"key":"52_CR6","unstructured":"Foulds, L.R., Wallace, S.W., Wilson, J., Sagvolden, L.: Bookmobile routing and scheduling in Buskerud County, Norway. In: Proceeding of the 36th Annual Conference of the Operational Research Society of New Zealand, pp. 67\u201377 (2001)"},{"key":"52_CR7","doi-asserted-by":"crossref","unstructured":"Garey, M., Graham, R., Johnson, D.: Some NP-complete geometric problems. In: Proceedings of the 8th Annual ACM Symposium on Theory of Computing, pp. 10\u201322 (1976)","DOI":"10.1145\/800113.803626"},{"key":"52_CR8","doi-asserted-by":"crossref","unstructured":"Gudmundsson, J., Levcopoulos, C., Narasimhan, G.: Improved greedy algorithms for constructing sparse geometric spanners. In: Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, pp. 163\u2013174 (2000)","DOI":"10.1007\/3-540-44985-X_28"},{"key":"52_CR9","doi-asserted-by":"crossref","unstructured":"Kolliopoulos, S., Rao, S.: A nearly linear-time approximation scheme for the euclidean k-median problem. In: Proceedings of the 7th Annual European Symposium on Algorithms, pp. 378\u2013389 (1999)","DOI":"10.1007\/3-540-48481-7_33"},{"issue":"4","key":"52_CR10","doi-asserted-by":"publisher","first-page":"1298","DOI":"10.1137\/S0097539796309764","volume":"28","author":"J.S.B. Mitchell","year":"1999","unstructured":"Mitchell, J.S.B.: Guillotine subdivisions approximate polygonal subdivisions: A simple polynomial-time approximation scheme for geometric TSP, k-MST and related problems. SIAM Journal on Computing\u00a028(4), 1298\u20131309 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"52_CR11","first-page":"106","volume-title":"Proceedings of the 30th Annual ACM Symposium on Theory of Computing","author":"S.B. Rao","year":"1998","unstructured":"Rao, S.B., Smith, W.D.: Approximating geometrical graphs via \u2019spanners\u2019 and \u2019banyans\u2019. In: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pp. 106\u2013113. ACM Press, New York (1998)"},{"key":"52_CR12","unstructured":"Tipping, J.: Scheduling and routing grass mowers around Christchurch. In: Proceeding of the 37th Annual Conference of the Operational Research Society of New Zealand (2002)"},{"key":"52_CR13","doi-asserted-by":"crossref","unstructured":"Vogt, L., Poojari, C.A., Beasley, J.E.: A tabu search algorithm for the single vehicle routing allocation problem. Journal of the Operational Research Society (to appear)","DOI":"10.1057\/palgrave.jors.2602165"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73951-7_52.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:06:04Z","timestamp":1619517964000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73951-7_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540739487","9783540739517"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73951-7_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}