Polynomial time approximation scheme for single-depot euclidean capacitated vehicle routing problem

Michael Khachay, Helen Zaytseva

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

7 Citations (Scopus)
Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages178-190
Number of pages13
Volume9486
ISBN (Print)9783319266251
DOIs
Publication statusPublished - 2015
Event9th International Conference on Combinatorial Optimization and Applications, COCOA 2015 - Houston, United States
Duration: 18 Dec 201520 Dec 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9486
ISSN (Print)03029743
ISSN (Electronic)16113349

Conference

Conference9th International Conference on Combinatorial Optimization and Applications, COCOA 2015
CountryUnited States
CityHouston
Period18/12/201520/12/2015

Fingerprint

Polynomial Time Approximation Scheme
Vehicle routing
Vehicle Routing Problem
Euclidean
Polynomials
Euclidean plane
Euclidean space
Customers
NP-complete problem

Keywords

  • Capacitated vehicle routing problem
  • Iterated tour partition
  • Polynomial time approximation scheme

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

WoS ResearchAreas Categories

  • Computer Science, Interdisciplinary Applications
  • Computer Science, Theory & Methods
  • Mathematics, Applied

Cite this

Khachay, M., & Zaytseva, H. (2015). Polynomial time approximation scheme for single-depot euclidean capacitated vehicle routing problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9486, pp. 178-190). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9486). Springer Verlag. https://doi.org/10.1007/978-3-319-26626-8_14
Khachay, Michael ; Zaytseva, Helen. / Polynomial time approximation scheme for single-depot euclidean capacitated vehicle routing problem. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 9486 Springer Verlag, 2015. pp. 178-190 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{dae325253b9a4d10b67e551bdbd751c8,
title = "Polynomial time approximation scheme for single-depot euclidean capacitated vehicle routing problem",
keywords = "Capacitated vehicle routing problem, Iterated tour partition, Polynomial time approximation scheme",
author = "Michael Khachay and Helen Zaytseva",
year = "2015",
doi = "10.1007/978-3-319-26626-8_14",
language = "English",
isbn = "9783319266251",
volume = "9486",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "178--190",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
address = "Germany",

}

Khachay, M & Zaytseva, H 2015, Polynomial time approximation scheme for single-depot euclidean capacitated vehicle routing problem. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 9486, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9486, Springer Verlag, pp. 178-190, 9th International Conference on Combinatorial Optimization and Applications, COCOA 2015, Houston, United States, 18/12/2015. https://doi.org/10.1007/978-3-319-26626-8_14

Polynomial time approximation scheme for single-depot euclidean capacitated vehicle routing problem. / Khachay, Michael; Zaytseva, Helen.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 9486 Springer Verlag, 2015. p. 178-190 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9486).

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

TY - GEN

T1 - Polynomial time approximation scheme for single-depot euclidean capacitated vehicle routing problem

AU - Khachay, Michael

AU - Zaytseva, Helen

PY - 2015

Y1 - 2015

KW - Capacitated vehicle routing problem

KW - Iterated tour partition

KW - Polynomial time approximation scheme

UR - http://www.scopus.com/inward/record.url?scp=84951941912&partnerID=8YFLogxK

UR - https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=tsmetrics&SrcApp=tsm_test&DestApp=WOS_CPL&DestLinkType=FullRecord&KeyUT=000375220400014

U2 - 10.1007/978-3-319-26626-8_14

DO - 10.1007/978-3-319-26626-8_14

M3 - Conference contribution

SN - 9783319266251

VL - 9486

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 178

EP - 190

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -

Khachay M, Zaytseva H. Polynomial time approximation scheme for single-depot euclidean capacitated vehicle routing problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 9486. Springer Verlag. 2015. p. 178-190. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-26626-8_14