scientific article; zbMATH DE number 7378615

DOI10.4230/LIPICS.APPROX-RANDOM.2018.3MaRDI QIDQ5009493

Amariah Becker

Publication date: 4 August 2021

Full work available at URL: https://arxiv.org/abs/1804.08791

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

graph algorithmsapproximation algorithmscapacitated vehicle routing

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (7)

Improved approximations for capacitated vehicle routing with unsplittable client demands ⋮ A PTAS for Capacitated Vehicle Routing on Trees ⋮ Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension ⋮ Improving the approximation ratio for capacitated vehicle routing ⋮ Improving the approximation ratio for capacitated vehicle routing ⋮ Capacitated vehicle routing problem on line with unsplittable demands ⋮ A tight approximation algorithm for multi-vehicle CVRP with unsplittable demands on a line

This page was built for publication: