|
This article is cited in 5 scientific papers (total in 5 papers)
INFORMATICS
Efficient approximation of the capacitated vehicle routing problem in a metric space of an arbitrary fixed doubling dimension
M. Yu. Khachayabc, Yu. Yu. Ogorodnikovab a N.N. Krasovskii Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, Ekaterinburg, Russian Federation
b Ural Federal University named after the First President of Russia B. N. Yeltsin, Ekaterinburg, Russian Federation
c Omsk State University, Omsk, Russian Federation
Abstract:
In this paper, for the first time, we provide a quasi-polynomial time approximation scheme for the well-known capacitated vehicle routing problem formulated in metric spaces of an arbitrary fixed doubling dimension.
Keywords:
capacitated vehicle routing problem, metric spaces of a fixed doubling dimension, quasi-polynomial time approximation scheme.
Citation:
M. Yu. Khachay, Yu. Yu. Ogorodnikov, “Efficient approximation of the capacitated vehicle routing problem in a metric space of an arbitrary fixed doubling dimension”, Dokl. RAN. Math. Inf. Proc. Upr., 493 (2020), 74–80; Dokl. Math., 102:1 (2020), 324–329
Linking options:
https://www.mathnet.ru/eng/danma98 https://www.mathnet.ru/eng/danma/v493/p74
|
Statistics & downloads: |
Abstract page: | 102 | Full-text PDF : | 39 | References: | 17 |
|