Efficient approximation of the metric CVRP in spaces of fixed doubling dimension
type: Item
instance of: scholarly article
title: Efficient approximation of the metric CVRP in spaces of fixed doubling dimension
zbMATH Open document ID: 1475.90082
author: Yuri Ogorodnikov
author: Daniel Khachay
author: M. Yu. Khachaĭ
published in: Journal of Global Optimization
publication date: 2021-08-17T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7382631
zbMATH Keywords: capacitated vehicle routing problem
zbMATH Keywords: fixed doubling dimension
zbMATH Keywords: quasi-polynomial time approximation scheme
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: s10898-020-00990-0
OpenAlex ID: W3126514426
cites work: Advances in metric embedding theory
cites work: PTAS FOR k-TOUR COVER PROBLEM ON THE PLANE FOR MODERATELY LARGE VALUES OF k
cites work: Knowledge-guided local search for the vehicle routing problem
cites work: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
cites work: Probabilistic checking of proofs
cites work: Q4526992
cites work: The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme
cites work: A PTAS for bounded-capacity vehicle routing in planar graphs
cites work: The truck dispatching problem
cites work: A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing
cites work: VNS methods for home care routing and scheduling problem with temporal dependencies, and multiple structures and specialties
cites work: Bounds and Heuristics for Capacitated Routing Problems
cites work: Polynomial-time approximation scheme for the capacitated vehicle routing problem with time windows
cites work: Approximability of the vehicle routing problem in finite-dimensional Euclidean spaces
cites work: PTAS for the Euclidean Capacitated Vehicle Routing Problem in $$R^d$$
cites work: Approximation scheme for the capacitated vehicle routing problem with time windows and non-uniform demand
cites work: Efficient approximation of the capacitated vehicle routing problem in a metric space of an arbitrary fixed doubling dimension
cites work: An extension of the Das and Mathieu QPTAS to the case of polylog capacity constrained CVRP in metric spaces of a fixed doubling dimension
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: Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems
cites work: A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups
cites work: A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups
cites work: Bypassing the embedding
cites work: Vehicle Routing
cites work: A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
DOI: 10.1007/S10898-020-00990-0
description: scientific article; zbMATH DE number 7382631