{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T06:47:35Z","timestamp":1773816455840,"version":"3.50.1"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030110260","type":"print"},{"value":"9783030110277","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-11027-7_30","type":"book-chapter","created":{"date-parts":[[2018,12,30]],"date-time":"2018-12-30T21:33:52Z","timestamp":1546205632000},"page":"318-328","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Efficient PTAS for the Euclidean CVRP with Time Windows"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3555-0080","authenticated-orcid":false,"given":"Michael","family":"Khachay","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1750-1368","authenticated-orcid":false,"given":"Yuri","family":"Ogorodnikov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,12,31]]},"reference":[{"key":"30_CR1","series-title":"Chapman & Hall\/CRC Data Mining and Knowledge Discovery Series","doi-asserted-by":"publisher","DOI":"10.1201\/b15410","volume-title":"Data Clustering: Algorithms and Applications","author":"CC Aggarwal","year":"2013","unstructured":"Aggarwal, C.C., Reddy, C.K.: Data Clustering: Algorithms and Applications. Chapman & Hall\/CRC Data Mining and Knowledge Discovery Series. Chapman and Hall\/CRC, Boca Raton (2013)"},{"issue":"2","key":"30_CR2","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10994-009-5103-0","volume":"75","author":"D Aloise","year":"2009","unstructured":"Aloise, D., Deshpande, A., Hansen, P., Popat, P.: NP-hardness of Euclidean sum-of-squares clustering. Mach. Learn. 75(2), 245\u2013248 (2009). https:\/\/doi.org\/10.1007\/s10994-009-5103-0","journal-title":"Mach. Learn."},{"key":"30_CR3","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":"30_CR4","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/j.cie.2015.12.007","volume":"99","author":"K Braekers","year":"2016","unstructured":"Braekers, K., Ramaekers, K., van Nieuwenhuyse, I.: The vehicle routing problem: state of the art classification and review. Comput. Ind. Eng. 99, 300\u2013313 (2016). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0360835215004775","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"30_CR5","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(1), 80\u201391 (1959)","journal-title":"Manag. Sci."},{"key":"30_CR6","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s00453-014-9906-4","volume":"73","author":"A Das","year":"2015","unstructured":"Das, A., Mathieu, C.: A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing. Algorithmica 73, 115\u2013142 (2015)","journal-title":"Algorithmica"},{"key":"30_CR7","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/j.cie.2015.11.022","volume":"91","author":"C Exp\u00f3sito-Izquierdo","year":"2016","unstructured":"Exp\u00f3sito-Izquierdo, C., Rossi, A., Sevaux, M.: A two-level solution approach to solve the clustered capacitated vehicle routing problem. Comput. Ind. Eng. 91, 274\u2013289 (2016). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0360835215004684","journal-title":"Comput. Ind. Eng."},{"issue":"4","key":"30_CR8","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 heuristics for capacitated routing problems. Math. Oper. Res. 10(4), 527\u2013542 (1985)","journal-title":"Math. Oper. Res."},{"key":"30_CR9","unstructured":"van Hoorn, J.J.: A note on the worst case complexity for the capacitated vehicle routing problem. In: Research Memorandum, vol. 5. Faculteit der Economische Wetenschappen en Bedrijfskunde (2010)"},{"issue":"11","key":"30_CR10","doi-asserted-by":"publisher","first-page":"1966","DOI":"10.1134\/S0965542509110128","volume":"49","author":"AV Kel\u2019manov","year":"2009","unstructured":"Kel\u2019manov, A.V., Pyatkin, A.V.: Complexity of certain problems of searching for subsets of vectors and cluster analysis. Comput. Math. Math. Phys. 49(11), 1966\u20131971 (2009). https:\/\/doi.org\/10.1134\/S0965542509110128","journal-title":"Comput. Math. Math. Phys."},{"issue":"1","key":"30_CR11","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1134\/S0081543817050133","volume":"297","author":"MY Khachai","year":"2017","unstructured":"Khachai, M.Y., Dubinin, R.D.: Approximability of the vehicle routing problem in finite-dimensional Euclidean spaces. Proc. Steklov Inst. Math. 297(1), 117\u2013128 (2017). https:\/\/doi.org\/10.1134\/S0081543817050133","journal-title":"Proc. Steklov Inst. Math."},{"key":"30_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-319-44914-2_16","volume-title":"Discrete Optimization and Operations Research","author":"M Khachay","year":"2016","unstructured":"Khachay, M., Dubinin, R.: PTAS for the Euclidean capacitated vehicle routing problem in $$R^d$$. In: Kochetov, Y., Khachay, M., Beresnev, V., Nurminski, E., Pardalos, P. (eds.) DOOR 2016. LNCS, vol. 9869, pp. 193\u2013205. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44914-2_16"},{"key":"30_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-319-26626-8_14","volume-title":"Combinatorial Optimization and Applications","author":"M Khachay","year":"2015","unstructured":"Khachay, M., Zaytseva, H.: Polynomial time approximation scheme for single-depot Euclidean capacitated vehicle routing problem. In: Lu, Z., Kim, D., Wu, W., Li, W., Du, D.-Z. (eds.) COCOA 2015. LNCS, vol. 9486, pp. 178\u2013190. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-26626-8_14"},{"key":"30_CR14","first-page":"66","volume":"4","author":"S Kumar","year":"2012","unstructured":"Kumar, S., Panneerselvam, R.: A survey on the vehicle routing problem and its variants. Intell. Inf. Manag. 4, 66\u201374 (2012)","journal-title":"Intell. Inf. Manag."},{"key":"30_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/978-3-319-71147-8_31","volume-title":"Combinatorial Optimization and Applications","author":"L Song","year":"2017","unstructured":"Song, L., Huang, H.: The Euclidean vehicle routing problem with multiple depots and time windows. In: Gao, X., Du, H., Han, M. (eds.) COCOA 2017. LNCS, vol. 10628, pp. 449\u2013456. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-71147-8_31"},{"issue":"4","key":"30_CR16","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.1007\/s10878-015-9931-5","volume":"32","author":"L Song","year":"2016","unstructured":"Song, L., Huang, H., Du, H.: Approximation schemes for Euclidean vehicle routing problems with time windows. J. Comb. Optim. 32(4), 1217\u20131231 (2016). https:\/\/doi.org\/10.1007\/s10878-015-9931-5","journal-title":"J. Comb. Optim."},{"key":"30_CR17","doi-asserted-by":"crossref","unstructured":"Toth, P., Vigo, D.: Vehicle Routing: Problems, Methods, and Applications, 2nd edn. MOS-SIAM Series on Optimization. SIAM (2014)","DOI":"10.1137\/1.9781611973594"}],"container-title":["Lecture Notes in Computer Science","Analysis of Images, Social Networks and Texts"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-11027-7_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T12:41:33Z","timestamp":1710333693000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-11027-7_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030110260","9783030110277"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-11027-7_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"31 December 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AIST","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Analysis of Images, Social Networks and Texts","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Moscow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 July 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aist2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/aistconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"81","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1.58","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"107 papers were sent and 26 of these were rejected without reviewing. 1 other paper was accepted due to the interdisciplinary nature of the paper.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}