Approximability of the vehicle routing problem in finite-dimensional Euclidean spaces
type: Item
instance of: scholarly article
title: Approximability of the vehicle routing problem in finite-dimensional Euclidean spaces
zbMATH Open document ID: 1397.90329
DOI: 10.1134/S0081543817050133
author: Roman D. Dubinin
author: M. Yu. Khachaĭ
published in: Proceedings of the Steklov Institute of Mathematics
publication date: 2017-10-27T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6798890
zbMATH Keywords: optimal routing
zbMATH Keywords: capacitated vehicle routing problem
zbMATH Keywords: approximability
zbMATH Keywords: EPTAS
describes a project that uses: VRP
MaRDI profile type: Publication
cites work: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
cites work: Q4526992
cites work: The truck dispatching problem
cites work: A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing
cites work: On the asymptotic optimality of a solution of the Euclidean problem of covering a graph by \(m\) nonadjacent cycles of maximum total weight
cites work: Bounds and Heuristics for Capacitated Routing Problems
cites work: Spherical Radial Basis Functions, Theory and Applications
cites work: Approximability of the minimum-weight \(k\)-size cycle cover problem
cites work: Polynomial Time Approximation Scheme for Single-Depot Euclidean Capacitated Vehicle Routing Problem
cites work: The Euclidean traveling salesman problem is NP-complete
cites work: Approximation schemes for Euclidean vehicle routing problems with time windows
full work available at URL: s0081543817050133
OpenAlex ID: W2404658402
description: scientific article; zbMATH DE number 6798890