scientific article; zbMATH DE number 1303035

MaRDI QIDQ4249536zbMATH OpenFDO

Authors Shin-Ya Hamaguchi, Naoki Katoh

Publication date 17 June 1999

zbMATH Keywords

NP-completevehicle routingtree-shaped networksingle depot

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)

Recommendations

• Capacitated Vehicle Routing on Trees
• Modeling and solving the capacitated vehicle routing problem on trees
• A PTAS for Capacitated Vehicle Routing on Trees
• A new approximation algorithm for the capacitated vehicle routing problem on a tree
• scientific article; zbMATH DE number 1522939
• On the capacitated vehicle routing problem
• On the approximation of the generalized capacitated tree-routing problem
• A tight 4/3 approximation for capacitated vehicle routing in trees
• A framework for vehicle routing approximation schemes in trees
• Approximating the Generalized Capacitated Tree-Routing Problem

Cited in

(16)

• Two exact algorithms for the vehicle routing problem on trees
• scientific article; zbMATH DE number 1522939 (Why is no real title available?)
• Capacitated vehicle routing problem on line with unsplittable demands
• Capacitated Vehicle Routing on Trees
• Selecting Good a Priori Sequences for Vehicle Routing Problem with Stochastic Demand
• An approximation algorithm for the pickup and delivery vehicle routing problem on trees
• A PTAS for Capacitated Vehicle Routing on Trees
• A polynomial-time exact algorithm for \(k\)-depot capacitated vehicle routing problem on a tree
• Approximation algorithms for the load-balanced capacitated vehicle routing problem
• A quasi-polynomial-time approximation scheme for vehicle routing on planar and bounded-genus graphs
• A new approximation algorithm for the capacitated vehicle routing problem on a tree
• Heuristics for vehicle routing on tree-like networks
• Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension
• A tight approximation algorithm for multi-vehicle CVRP with unsplittable demands on a line
• A tight 4/3 approximation for capacitated vehicle routing in trees
• Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4249536)