A new approximation algorithm for the capacitated vehicle routing problem on a tree
From MaRDI portal
Publication:5943821
DOI10.1023/A:1011461300596zbMath1039.90007OpenAlexW1529079830MaRDI QIDQ5943821
Naoki Katoh, Tetsuo Asano, Kazuhiro Kawashima
Publication date: 2001
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1011461300596
Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)
Related Items (15)
Approximation algorithms for distance constrained vehicle routing problems ⋮ Improved algorithms for joint optimization of facility locations and network connections ⋮ An approximation algorithm for the pickup and delivery vehicle routing problem on trees ⋮ A PTAS for Capacitated Vehicle Routing on Trees ⋮ 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times. ⋮ Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension ⋮ Minmax subtree cover problem on cacti ⋮ Improving the approximation ratio for capacitated vehicle routing ⋮ Approximation algorithms for the load-balanced capacitated vehicle routing problem ⋮ Improving the approximation ratio for capacitated vehicle routing ⋮ Selecting Good a Priori Sequences for Vehicle Routing Problem with Stochastic Demand ⋮ A faster 2-approximation algorithm for the minmax \(p\)-traveling salesmen problem on a tree ⋮ A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs ⋮ 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: A new approximation algorithm for the capacitated vehicle routing problem on a tree
