{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:26:49Z","timestamp":1758274009363},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540281016"},{"type":"electronic","value":"9783540317111"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11534273_32","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T13:31:47Z","timestamp":1268400707000},"page":"360-371","source":"Crossref","is-referenced-by-count":3,"title":["On the Vehicle Routing Problem"],"prefix":"10.1007","author":[{"given":"Piotr","family":"Berman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Surajit K.","family":"Das","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"32_CR1","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. J. ACM\u00a045(5), 753\u2013782 (1998)","journal-title":"J. ACM"},{"doi-asserted-by":"crossref","unstructured":"Agrawal, A., Klein, P., Ravi, R.: When Trees Collide: An approximation algorithm for the generalized Steiner problem on networks. In: Proceedings of 23rd STOC, pp. 134\u2013144 (1991)","key":"32_CR2","DOI":"10.1145\/103418.103437"},{"issue":"3","key":"32_CR3","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1287\/opre.40.3.574","volume":"40","author":"D.J. Bertsimas","year":"1992","unstructured":"Bertsimas, D.J.: A Vehicle Routing Problem with Stochastic Demand. Operations Research\u00a040(3), 574\u2013585 (1992)","journal-title":"Operations Research"},{"doi-asserted-by":"crossref","unstructured":"Charnes, A., Cooper, W.: Chance Constrained Programming. Management Science\u00a0(6), 73\u201379 (1959); Transportation Science 2(29) (1959)","key":"#cr-split#-32_CR4.2","DOI":"10.1287\/mnsc.6.1.73"},{"issue":"3","key":"32_CR5","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1137\/S0097539701392056","volume":"31","author":"M. Charikar","year":"2001","unstructured":"Charikar, M., Khuller, S., Raghavachari, B.: Algorithms for Capacitated Vehicle Routing. SIAM Journal of Computing\u00a031(3), 665\u2013682 (2001)","journal-title":"SIAM Journal of Computing"},{"unstructured":"Christofides, N.: Worst Case Analysis of a new heuristic for the TSP. Report 388, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA (1976)","key":"32_CR6"},{"key":"32_CR7","first-page":"2","volume":"29","author":"M. Gendreau","year":"1995","unstructured":"Gendreau, M., Laporte, G., Seguin, R.: An Exact Algorithm for the VRP with Stochastic Demands and Customers. Transportation Science\u00a029, 2 (1995)","journal-title":"Transportation Science"},{"key":"32_CR8","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1137\/S0097539793242618","volume":"24","author":"M.X. Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: A General Approximation Technique For Constrained Forest Problems. SIAM Journal of Computing\u00a024, 296\u2013317 (1995)","journal-title":"SIAM Journal of Computing"},{"doi-asserted-by":"crossref","unstructured":"Haimovich, M., Rinnooy Kan, A.: Bounds and Heuristics for the Capacitated Routing Problem. Mathematics of Operations Research\u00a0(10), 527\u2013542 (1985)","key":"32_CR9","DOI":"10.1287\/moor.10.4.527"},{"key":"32_CR10","volume-title":"Vehicle Routing: Methods and Studies","author":"M. Haimovich","year":"1988","unstructured":"Haimovich, M., Rinnooy Kan, A., Stougie, L.: Analysis of heuristics for Vehicle Routing Problems. In: Golden, B.L., Assad, A.A. (eds.) Vehicle Routing: Methods and Studies, North-Holland, Amsterdam (1988)"},{"unstructured":"Secomandi, N.: Exact and Heuristic DP algorithms for the VRP with Stochastic Demands. Ph.D. Dissertation, Dept. of Decision and Info. Sciences, University of Houston, Texas (1998)","key":"32_CR11"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11534273_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:10:00Z","timestamp":1605643800000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11534273_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540281016","9783540317111"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11534273_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}