{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,9]],"date-time":"2025-12-09T15:34:59Z","timestamp":1765294499852},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642208065"},{"type":"electronic","value":"9783642208072"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20807-2_19","type":"book-chapter","created":{"date-parts":[[2011,6,18]],"date-time":"2011-06-18T09:58:49Z","timestamp":1308391129000},"page":"235-247","source":"Crossref","is-referenced-by-count":5,"title":["Capacitated Vehicle Routing with Non-uniform Speeds"],"prefix":"10.1007","author":[{"given":"Inge Li","family":"G\u00f8rtz","sequence":"first","affiliation":[]},{"given":"Marco","family":"Molinaro","sequence":"additional","affiliation":[]},{"given":"Viswanath","family":"Nagarajan","sequence":"additional","affiliation":[]},{"given":"R.","family":"Ravi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0167-6377(87)90012-5","volume":"6","author":"K. Altinkemer","year":"1987","unstructured":"Altinkemer, K., Gavish, B.: Heuristics for unequal weight delivery problems with a fixed error guarantee. Operations Research Letters\u00a06, 149\u2013158 (1987)","journal-title":"Operations Research Letters"},{"key":"19_CR2","first-page":"294","volume":"24","author":"K. Altinkemer","year":"1990","unstructured":"Altinkemer, K., Gavish, B.: Heuristics for delivery problems with constant error guarantees. Transportation Research\u00a024, 294\u2013297 (1990)","journal-title":"Transportation Research"},{"issue":"1","key":"19_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jalgor.2005.01.007","volume":"59","author":"E.M. Arkin","year":"2006","unstructured":"Arkin, E.M., Hassin, R., Levin, A.: Approximations for minimum and min-max vehicle routing problems. Journal of Algorithms\u00a059(1), 1\u201318 (2006)","journal-title":"Journal of Algorithms"},{"key":"19_CR4","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, 753\u2013782 (1998)","journal-title":"J. ACM"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Baratz, A., Peleg, D.: Cost-sensitive analysis of communication protocols. In: Proceedings of the 9th Annual Symposium on Principles of Distributed Computing, pp. 177\u2013187 (1990)","DOI":"10.1145\/93385.93417"},{"issue":"2","key":"19_CR6","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1137\/050645464","volume":"37","author":"A. Blum","year":"2007","unstructured":"Blum, A., Chawla, S., Karger, D.R., Lane, T., Meyerson, A., Minkoff, M.: Approximation algorithms for orienteering and discounted-reward tsp. SIAM J. Comput.\u00a037(2), 653\u2013670 (2007)","journal-title":"SIAM J. Comput."},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1017\/S0021900200002850","volume":"44","author":"A. Bompadre","year":"2007","unstructured":"Bompadre, A., Dror, M., Orlin, J.: Probabilistic Analysis of Unit Demand Vehicle Routing Problems. J. Appl. Probab.\u00a044, 259\u2013278 (2007)","journal-title":"J. Appl. Probab."},{"key":"19_CR8","first-page":"661","volume-title":"SODA","author":"C. Chekuri","year":"2008","unstructured":"Chekuri, C., Korula, N., P\u00e1l, M.: Improved algorithms for orienteering and related problems. In: Teng, S.-H. (ed.) SODA, pp. 661\u2013670. SIAM, Philadelphia (2008)"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-540-27821-4_7","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"C. Chekuri","year":"2004","unstructured":"Chekuri, C., Kumar, A.: Maximum coverage problem with group budget constraints and applications. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol.\u00a03122, pp. 72\u201383. Springer, Heidelberg (2004)"},{"key":"19_CR10","unstructured":"Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem. Report 388, Graduate School of Industrial Administration, CMU (1976)"},{"key":"19_CR11","volume-title":"Combinatorial optimization","author":"W.J. Cook","year":"1998","unstructured":"Cook, W.J., Cunningham, W.H., Pulleyblank, W.R., Schrijver, A.: Combinatorial optimization. John Wiley & Sons, Inc., New York (1998)"},{"key":"19_CR12","first-page":"390","volume-title":"SODA","author":"A. Das","year":"2010","unstructured":"Das, A., Mathieu, C.: A Quasi-polynomial Time Approximation Scheme for Euclidean Capacitated Vehicle Routing. In: Charikar, M. (ed.) SODA, pp. 390\u2013403. SIAM, Philadelphia (2010)"},{"issue":"4","key":"19_CR13","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/j.orl.2003.11.010","volume":"32","author":"G. Even","year":"2004","unstructured":"Even, G., Garg, N., K\u00f6nemann, J., Ravi, R., Sinha, A.: Min-max tree covers of graphs. Oper. Res. Lett.\u00a032(4), 309\u2013315 (2004)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"19_CR14","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1137\/0207017","volume":"7","author":"G.N. Frederickson","year":"1978","unstructured":"Frederickson, G.N., Hecht, M.S., Kim, C.E.: Approximation algorithms for some routing problems. SIAM J. Comput.\u00a07(2), 178\u2013193 (1978)","journal-title":"SIAM J. Comput."},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Garg, N.: Saving an epsilon: a 2-approximation for the k-MST problem in graphs. In: Proceedings of the 34th Annual ACM Symposium on the Theory of Computing, pp. 396\u2013402 (2005)","DOI":"10.1145\/1060590.1060650"},{"key":"19_CR16","unstructured":"Gupta, A., Nagarajan, V., Ravi, R.: Approximation Algorithms for VRP with Stochastic Demands (2010) (submitted)"},{"issue":"4","key":"19_CR17","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1287\/moor.10.4.527","volume":"10","author":"M. Haimovich","year":"1985","unstructured":"Haimovich, M., Kan, A.H.G.R.: Bounds and heuristics for capacitated routing problems. Mathematics of Operations Research\u00a010(4), 527\u2013542 (1985)","journal-title":"Mathematics of Operations Research"},{"issue":"4","key":"19_CR18","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/BF01294129","volume":"14","author":"S. Khuller","year":"1995","unstructured":"Khuller, S., Raghavachari, B., Young, N.E.: Balancing minimum spanning trees and shortest-path trees. Algorithmica\u00a014(4), 305\u2013321 (1995)","journal-title":"Algorithmica"},{"key":"19_CR19","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF01585745","volume":"46","author":"J.K. Lenstra","year":"1990","unstructured":"Lenstra, J.K., Shmoys, D.B., Tardos, E.: Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming\u00a046, 259\u2013271 (1990), doi:10.1007\/BF01585745","journal-title":"Mathematical Programming"},{"issue":"4","key":"19_CR20","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":"19_CR21","doi-asserted-by":"crossref","unstructured":"Toth, P., Vigo, D. (eds.): The vehicle routing problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, PA, USA (2002)","DOI":"10.1137\/1.9780898718515"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatoral Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20807-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,28]],"date-time":"2019-03-28T22:31:38Z","timestamp":1553812298000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20807-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642208065","9783642208072"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20807-2_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}