{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T15:27:53Z","timestamp":1725809273611},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319126906"},{"type":"electronic","value":"9783319126913"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12691-3_18","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T16:11:32Z","timestamp":1415981492000},"page":"231-238","source":"Crossref","is-referenced-by-count":0,"title":["A Bicriteria Approximation Algorithm for DVRP with Time Windows"],"prefix":"10.1007","author":[{"given":"Hao","family":"Gu","sequence":"first","affiliation":[]},{"given":"Liang","family":"Song","sequence":"additional","affiliation":[]},{"given":"Hejiao","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Hongwei","family":"Du","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,11,13]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1002\/net.3230140113","volume":"14","author":"G Laporte","year":"1984","unstructured":"Laporte, G., Desrochers, M., Nobert, Y.: Two exact algorithms for the distance constrained vehicle routing problem. Networks 14, 47\u201361 (1984)","journal-title":"Networks"},{"key":"18_CR2","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. Manage. Sci. 6, 80 (1959)","journal-title":"Manage. Sci."},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"790","DOI":"10.1287\/opre.40.4.790","volume":"40","author":"C Li","year":"1992","unstructured":"Li, C., Simchi-Levi, D., Desrochers, M.: On the distance constrained vehicle routing problem. Oper. Res. 40, 790\u2013799 (1992)","journal-title":"Oper. Res."},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1002\/net.20435","volume":"3","author":"V Nagarajan","year":"2012","unstructured":"Nagarajan, V., Ravi, R.: Approximation algorithms for distance constrained vehicle routing problems. Networks 3, 209\u2013214 (2012)","journal-title":"Networks"},{"key":"18_CR5","volume-title":"Application Handbook of Genetic Algorithms: New Frontiers","author":"S Thangiah","year":"1995","unstructured":"Thangiah, S.: Vehicle routing with time windows using genetic algorithms. In: Chambers, L. (ed.) Application Handbook of Genetic Algorithms: New Frontiers, vol. II. CRC Press, Boca Raton (1995)"},{"key":"18_CR6","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. Theoret. Comput. Sci. 434, 1\u201310 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"18_CR7","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. Theoret. Comput. Sci. 393, 133\u2013146 (2008)","journal-title":"Theoret. Comput. Sci."},{"key":"18_CR8","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. Theoret. Comput. Sci. 312, 267\u2013280 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1287\/opre.40.2.342","volume":"40","author":"M Desrochers","year":"1992","unstructured":"Desrochers, M., Desrosiers, J., Solomon, M.: A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. 40, 342\u2013354 (1992)","journal-title":"Oper. Res."},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/BF02022044","volume":"4","author":"M Savelsbergh","year":"1985","unstructured":"Savelsbergh, M.: Local search for routing problems with time windows. Ann. Oper. Res. 4, 285\u2013305 (1985)","journal-title":"Ann. Oper. Res."},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Bansal, N., Blum, A., Chawla, S., Meyerson, A.: Approximation algorithms for deadline-TSP and vehicle routing with time-windows. In: STOC \u201904 Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing, pp. 166\u2013174 (2004)","DOI":"10.1145\/1007352.1007385"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12691-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,17]],"date-time":"2019-08-17T07:35:13Z","timestamp":1566027313000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-12691-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319126906","9783319126913"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12691-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}