Standard

Polynomial Capacity Guarantees PTAS for the Euclidean Capacitated Vehicle Routing Problem Even for Non-uniform Non-splittable Demand. / Khachay, Michael; Ogorodnikov, Yuri.
Optimization and Applications - 10th International Conference, OPTIMA 2019, Revised Selected Papers. ред. / Milojica Jaćimović; Michael Khachay; Vlasta Malkova; Mikhail Posypkin. Том 1145 Springer, 2020. стр. 415-426 (Communications in Computer and Information Science; Том 1145 CCIS).

Результаты исследований: Глава в книге, отчете, сборнике статей › Материалы конференции › Рецензирование

Harvard

Khachay, M & Ogorodnikov, Y 2020, Polynomial Capacity Guarantees PTAS for the Euclidean Capacitated Vehicle Routing Problem Even for Non-uniform Non-splittable Demand. в M Jaćimović, M Khachay, V Malkova & M Posypkin (ред.), Optimization and Applications - 10th International Conference, OPTIMA 2019, Revised Selected Papers. Том. 1145, Communications in Computer and Information Science, Том. 1145 CCIS, Springer, стр. 415-426, 10th International Conference on Optimization and Applications, OPTIMA 2019, Petrovac, Черногория, 30/09/2019. https://doi.org/10.1007/978-3-030-38603-0_30

APA

Khachay, M., & Ogorodnikov, Y. (2020). Polynomial Capacity Guarantees PTAS for the Euclidean Capacitated Vehicle Routing Problem Even for Non-uniform Non-splittable Demand. в M. Jaćimović, M. Khachay, V. Malkova, & M. Posypkin (Ред.), Optimization and Applications - 10th International Conference, OPTIMA 2019, Revised Selected Papers (Том 1145, стр. 415-426). (Communications in Computer and Information Science; Том 1145 CCIS). Springer. https://doi.org/10.1007/978-3-030-38603-0_30

Vancouver

Khachay M, Ogorodnikov Y. Polynomial Capacity Guarantees PTAS for the Euclidean Capacitated Vehicle Routing Problem Even for Non-uniform Non-splittable Demand. в Jaćimović M, Khachay M, Malkova V, Posypkin M, Редакторы, Optimization and Applications - 10th International Conference, OPTIMA 2019, Revised Selected Papers. Том 1145. Springer. 2020. стр. 415-426. (Communications in Computer and Information Science). doi: 10.1007/978-3-030-38603-0_30

Author

Khachay, Michael ; Ogorodnikov, Yuri. / Polynomial Capacity Guarantees PTAS for the Euclidean Capacitated Vehicle Routing Problem Even for Non-uniform Non-splittable Demand. Optimization and Applications - 10th International Conference, OPTIMA 2019, Revised Selected Papers. Редактор / Milojica Jaćimović ; Michael Khachay ; Vlasta Malkova ; Mikhail Posypkin. Том 1145 Springer, 2020. стр. 415-426 (Communications in Computer and Information Science).

BibTeX

@inproceedings{39241cd5d75c47dca207bbce929515d8,
title = "Polynomial Capacity Guarantees PTAS for the Euclidean Capacitated Vehicle Routing Problem Even for Non-uniform Non-splittable Demand",
keywords = "Capacitated Vehicle Routing Problem, Non-uniform splittable demand, Polynomial Time Approximation Scheme",
author = "Michael Khachay and Yuri Ogorodnikov",
year = "2020",
month = jan,
day = "1",
doi = "10.1007/978-3-030-38603-0_30",
language = "English",
isbn = "9783030386023",
volume = "1145",
series = "Communications in Computer and Information Science",
publisher = "Springer",
pages = "415--426",
editor = "Milojica Ja{\'c}imovi{\'c} and Michael Khachay and Vlasta Malkova and Mikhail Posypkin",
booktitle = "Optimization and Applications - 10th International Conference, OPTIMA 2019, Revised Selected Papers",
address = "Germany",
note = "10th International Conference on Optimization and Applications, OPTIMA 2019 ; Conference date: 30-09-2019 Through 04-10-2019",

}

RIS

TY - GEN

T1 - Polynomial Capacity Guarantees PTAS for the Euclidean Capacitated Vehicle Routing Problem Even for Non-uniform Non-splittable Demand

AU - Khachay, Michael

AU - Ogorodnikov, Yuri

PY - 2020/1/1

Y1 - 2020/1/1

KW - Capacitated Vehicle Routing Problem

KW - Non-uniform splittable demand

KW - Polynomial Time Approximation Scheme

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

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

U2 - 10.1007/978-3-030-38603-0_30

DO - 10.1007/978-3-030-38603-0_30

M3 - Conference contribution

AN - SCOPUS:85078466903

SN - 9783030386023

VL - 1145

T3 - Communications in Computer and Information Science

SP - 415

EP - 426

BT - Optimization and Applications - 10th International Conference, OPTIMA 2019, Revised Selected Papers

A2 - Jaćimović, Milojica

A2 - Khachay, Michael

A2 - Malkova, Vlasta

A2 - Posypkin, Mikhail

PB - Springer

T2 - 10th International Conference on Optimization and Applications, OPTIMA 2019

Y2 - 30 September 2019 through 4 October 2019

ER -

ID: 11993365