Efficient PTAS for the Euclidean CVRP with time windows › Research Explorer

DOI

https://doi.org/10.1007/978-3-030-11027-7_30
Final published version

Original language	English
Title of host publication	Analysis of Images, Social Networks and Texts - 7th International Conference, AIST 2018, Revised Selected Papers
Editors	Alexander Panchenko, Wil M. van der Aalst, Michael Khachay, Panos M. Pardalos, Vladimir Batagelj, Natalia Loukachevitch, Goran Glavaš, Dmitry I. Ignatov, Sergei O. Kuznetsov, Olessia Koltsova, Irina A. Lomazova, Andrey V. Savchenko, Amedeo Napoli, Marcello Pelillo
Publisher	Springer Verlag
Pages	318-328
Number of pages	11
ISBN (Print)	9783030110260
DOIs	https://doi.org/10.1007/978-3-030-11027-7_30
Publication status	Published - 1 Jan 2018
Event	7th International Conference on Analysis of Images, Social Networks and Texts, AIST 2018 - Moscow, Russian Federation Duration: 5 Jul 2018 → 7 Jul 2018

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	11179 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	7th International Conference on Analysis of Images, Social Networks and Texts, AIST 2018
Country/Territory	Russian Federation
City	Moscow
Period	05/07/2018 → 07/07/2018

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Research areas

Capacitated vehicle routing problem, Efficient polynomial time approximation scheme, Time windows

ID: 8876050