{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:40:52Z","timestamp":1743039652069,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319126906"},{"type":"electronic","value":"9783319126913"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12691-3_6","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T21:11:32Z","timestamp":1415999492000},"page":"66-73","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Quasi-polynomial Time Approximation Scheme for Euclidean CVRPTW"],"prefix":"10.1007","author":[{"given":"Liang","family":"Song","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hejiao","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongwei","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,11,13]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manag. Sci. 6, 80\u201391 (1959)","journal-title":"Manag. Sci."},{"key":"6_CR2","volume-title":"The Vehicle Routing Problem","author":"P Toth","year":"2001","unstructured":"Toth, P., Vigo, D.: The Vehicle Routing Problem. Society for Industrial and Applied Mathematics, Philadelphia (2001)"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2012.01.046","volume":"434","author":"X Bao","year":"2012","unstructured":"Bao, X., Liu, Z.: Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle. Theor. Comput. Sci. 434, 1\u201310 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.tcs.2007.12.001","volume":"393","author":"H Nagamochi","year":"2008","unstructured":"Nagamochi, H., Ohnishi, T.: Approximating a vehicle scheduling problem with time windows and handling times. Theor. Comput. Sci. 393, 133\u2013146 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/j.tcs.2003.09.010","volume":"312","author":"Y Karuno","year":"2004","unstructured":"Karuno, Y., Nagamochi, H.: An approximability result of the multi-vehicle scheduling problem on a path with release and handling times. Theor. Comput. Sci. 312, 267\u2013280 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1023\/B:ANOR.0000039517.35989.6d","volume":"131","author":"P Lacomme","year":"2004","unstructured":"Lacomme, P., Prins, C., Ramdane-Ch\u00e9rif, W.: Competitive memetic algorithms for arc routing problems. Ann. Oper. Res. 131, 159\u2013185 (2004)","journal-title":"Ann. Oper. Res."},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"52","DOI":"10.12720\/jtle.2.1.52-58","volume":"2","author":"NE Toklu","year":"2014","unstructured":"Toklu, N.E., Gambardella, L.M., Montemanni, R.: A multiple ant colony system for a vehicle routing problem with time windows and uncertain travel times. J. Traffic Logist. Eng. 2, 52\u201358 (2014)","journal-title":"J. Traffic Logist. Eng."},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1287\/opre.1120.1153","volume":"61","author":"R Baldacci","year":"2013","unstructured":"Baldacci, R., Mingozzi, A., Roberti, R., Calvo, R.W.: An exact algorithm for the two-echelon capacitated vehicle routing problem. Oper. Res. 61, 298\u2013314 (2013)","journal-title":"Oper. Res."},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"1269","DOI":"10.1287\/opre.1110.0975","volume":"59","author":"R Baldacci","year":"2011","unstructured":"Baldacci, R., Mingozzi, A., Roberti, R.: New route relaxation and pricing strategies for the vehicle routing problem. Oper. Res. 59, 1269\u20131283 (2011)","journal-title":"Oper. Res."},{"key":"6_CR10","first-page":"1","volume":"28","author":"JC Sousaa","year":"2011","unstructured":"Sousaa, J.C., Biswasa, H.A., Britob, R., Silveirab, A.: A multi objective approach to solve capacitated vehicle routing problems with time windows using mixed integer linear programming. Int. J. Adv. Sci. Technol. 28, 1\u20138 (2011)","journal-title":"Int. J. Adv. Sci. Technol."},{"key":"6_CR11","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s10107-003-0438-y","volume":"97","author":"S Arora","year":"2003","unstructured":"Arora, S.: Approximation schemes for NP-hard geometric optimization problems: a survey. Math. Program. 97, 43\u201369 (2003)","journal-title":"Math. Program."},{"key":"6_CR12","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 45, 753\u2013782 (1998)","journal-title":"J. ACM"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Das, A., Mathieu, C.: A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing. In: The Twenty First Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, Philadelphia (2009)","DOI":"10.1137\/1.9781611973075.33"},{"key":"6_CR14","unstructured":"Das, A.: Approximation schemes for euclidean vehicle routing problems. Dissertation, Brown University, Providence, Rhode Island, USA (2011)"},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1287\/moor.10.4.527","volume":"10","author":"M Haimovich","year":"1985","unstructured":"Haimovich, M., Rinnooy Kan, A.H.G.: Bounds and heuristic for capacitated routing problems. Math. Oper. Res. 10, 527\u2013542 (1985)","journal-title":"Math. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12691-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,21]],"date-time":"2023-01-21T03:37:06Z","timestamp":1674272226000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-12691-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319126906","9783319126913"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12691-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"13 November 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}