Capacitated vehicle routing problem on line with unsplittable demands

DOI10.1007/s10878-020-00565-5zbMath1502.90160OpenAlexW3016220462MaRDI QIDQ2082210

Yuanxiao Wu, Xi-wen Lu

Publication date: 4 October 2022

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-020-00565-5

zbMATH Keywords

networkvehicle routingapproximation algorithmworst-case analysis

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (1)

A tight approximation algorithm for multi-vehicle CVRP with unsplittable demands on a line

Cites Work

• A branch and bound algorithm for the capacitated vehicle routing problem
• Minimizing makespan on a single batch processing machine with nonidentical job sizes
• Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees
• Bounds and Heuristics for Capacitated Routing Problems
• Capacitated Vehicle Routing on Trees
• Improved bounds for batch scheduling with nonidentical job sizes
• A new approximation algorithm for the capacitated vehicle routing problem on a tree
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Capacitated vehicle routing problem on line with unsplittable demands