{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:16:02Z","timestamp":1761894962325},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642041273"},{"type":"electronic","value":"9783642041280"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04128-0_48","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T14:16:36Z","timestamp":1252937796000},"page":"540-552","source":"Crossref","is-referenced-by-count":9,"title":["Minimum Makespan Multi-vehicle Dial-a-Ride"],"prefix":"10.1007","author":[{"given":"Inge Li","family":"G\u00f8rtz","sequence":"first","affiliation":[]},{"given":"Viswanath","family":"Nagarajan","sequence":"additional","affiliation":[]},{"given":"R.","family":"Ravi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"48_CR1","first-page":"153","volume":"41","author":"B.S. Baker","year":"1994","unstructured":"Baker, B.S.: Approximation Algorithms for NP-Complete Problems on Planar Graphs. J.\u00a0ACM\u00a041, 153\u2013180 (1994)","journal-title":"J.\u00a0ACM"},{"key":"48_CR2","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1016\/S0305-0548(00)00056-3","volume":"29","author":"I.-M. Chao","year":"2002","unstructured":"Chao, I.-M.: A tabu search method for the truck and trailer routing problem. Computer & Operations Research\u00a029, 469\u2013488 (2002)","journal-title":"Computer & Operations Research"},{"key":"48_CR3","doi-asserted-by":"crossref","unstructured":"Charikar, M., Raghavachari, B.: The Finite Capacity Dial-A-Ride Problem. In: FOCS, pp. 458\u2013467 (1998)","DOI":"10.1109\/SFCS.1998.743496"},{"key":"48_CR4","doi-asserted-by":"crossref","unstructured":"Cordeau, J.-F., Laporte, G.: The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms. 4OR: A Quarterly Journal of Operations Research\u00a01(2) (2003)","DOI":"10.1007\/s10288-002-0009-8"},{"issue":"2","key":"48_CR5","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1287\/ijoc.1030.0052","volume":"16","author":"W.E. Paepe de","year":"2004","unstructured":"de Paepe, W.E., Lenstra, J.K., Sgall, J., Sitters, R.A., Stougie, L.: Computer-Aided Complexity Classification of Dial-a-Ride Problems. Informs J. Comp.\u00a016(2), 120\u2013132 (2004)","journal-title":"Informs J. Comp."},{"key":"48_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1007\/978-3-540-45198-3_3","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"G. Even","year":"2003","unstructured":"Even, G., Garg, N., K\u00f6nemann, J., Ravi, R., Sinha, A.: Covering Graphs Using Trees and Stars. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds.) RANDOM 2003 and APPROX 2003. LNCS, vol.\u00a02764, pp. 24\u201335. Springer, Heidelberg (2003)"},{"key":"48_CR7","doi-asserted-by":"crossref","unstructured":"Fakcharoenphol, J., Rao, S., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. In: STOC, pp. 448\u2013455 (2003)","DOI":"10.1145\/780542.780608"},{"issue":"2","key":"48_CR8","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":"48_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/11830924_20","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"I.L. G\u00f8rtz","year":"2006","unstructured":"G\u00f8rtz, I.L.: Hardness of Preemptive Finite Capacity Dial-a-Ride. In: D\u00edaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX 2006 and RANDOM 2006. LNCS, vol.\u00a04110, pp. 200\u2013211. Springer, Heidelberg (2006)"},{"key":"48_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-540-75520-3_23","volume-title":"Algorithms \u2013 ESA 2007","author":"A. Gupta","year":"2007","unstructured":"Gupta, A., Hajiaghayi, M., Nagarajan, V., Ravi, R.: Dial a Ride from k-forest. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol.\u00a04698, pp. 241\u2013252. Springer, Heidelberg (2007)"},{"key":"48_CR11","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. Math. Oper. Res.\u00a010, 527\u2013542 (1985)","journal-title":"Math. Oper. Res."},{"key":"48_CR12","first-page":"130","volume":"32","author":"D. Hochbaum","year":"1985","unstructured":"Hochbaum, D., Maass, W.: Approximation Schemes for Covering and Packing Problems in Image Processing and VLSI. J.\u00a0ACM\u00a032, 130\u2013136 (1985)","journal-title":"J.\u00a0ACM"},{"key":"48_CR13","unstructured":"Khuller, S., Raghavachari, B., Young, N.: Balancing minimum spanning and shortest path trees. In: SODA, pp. 243\u2013250 (1993)"},{"key":"48_CR14","doi-asserted-by":"crossref","unstructured":"Klein, P., Plotkin, S.A., Rao, S.: Excluded minors, network decomposition, and multicommodity flow. In: STOC, pp. 682\u2013690 (1993)","DOI":"10.1145\/167088.167261"},{"key":"48_CR15","first-page":"217","volume":"44","author":"S. Mitrovi\u0107-Mini\u0107","year":"2006","unstructured":"Mitrovi\u0107-Mini\u0107, S., Laporte, G.: The Pickup and Delivery Problem with Time Windows and Transshipment. INFOR Inf. Syst. Oper. Res.\u00a044, 217\u2013227 (2006)","journal-title":"INFOR Inf. Syst. Oper. Res."},{"key":"48_CR16","doi-asserted-by":"crossref","unstructured":"Mues, C., Pickl, S.: Transshipment and time windows in vehicle routing. In: 8th Int. Symp. on Parallel Architectures, Algorithms and Networks, pp. 113\u2013119 (2005)","DOI":"10.1109\/ISPAN.2005.88"},{"key":"48_CR17","doi-asserted-by":"crossref","unstructured":"Nakao, Y., Nagamochi, H.: Worst case analysis for pickup and delivery problems with transfer. IEICE Trans. on Fund. of Electronics, Comm. and Computer Sci.\u00a0E91-A(9) (2008)","DOI":"10.1093\/ietfec\/e91-a.9.2328"},{"key":"48_CR18","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1287\/trsc.29.1.17","volume":"29","author":"M. Savelsbergh","year":"1995","unstructured":"Savelsbergh, M., Sol, M.: The general pickup and delivery problem. Transportation Science\u00a029, 17\u201329 (1995)","journal-title":"Transportation Science"},{"key":"48_CR19","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1016\/j.cor.2004.08.002","volume":"33","author":"S. Scheuerer","year":"2006","unstructured":"Scheuerer, S.: A tabu search heuristic for the truck and trailer routing problem. Computer & Operations Research\u00a033, 894\u2013909 (2006)","journal-title":"Computer & Operations Research"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04128-0_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T11:22:35Z","timestamp":1558524155000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04128-0_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642041273","9783642041280"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04128-0_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}