Capacitated vehicle routing problem on line with unsplittable demands
type: Item
instance of: scholarly article
title: Capacitated vehicle routing problem on line with unsplittable demands
zbMATH Open document ID: 1502.90160
author: Yuanxiao Wu
author: Xiwen Lu
published in: Journal of Combinatorial Optimization
publication date: 2022-10-04T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7595927
zbMATH Keywords: vehicle routing
zbMATH Keywords: worst-case analysis
zbMATH Keywords: network
zbMATH Keywords: approximation algorithm
MaRDI profile type: Publication
full work available at URL: s10878-020-00565-5
OpenAlex ID: W3016220462
cites work: Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees
cites work: A new approximation algorithm for the capacitated vehicle routing problem on a tree
cites work: Q5009493
cites work: Q2957914
cites work: Improved bounds for batch scheduling with nonidentical job sizes
cites work: Bounds and Heuristics for Capacitated Routing Problems
cites work: Q4249536
cites work: Capacitated Vehicle Routing on Trees
cites work: A branch and bound algorithm for the capacitated vehicle routing problem
cites work: Minimizing makespan on a single batch processing machine with nonidentical job sizes
DOI: 10.1007/S10878-020-00565-5
Recommended article: Improved approximations for capacitated vehicle routing with unsplittable client demands
Recommended article: On the capacitated vehicle routing problem
Recommended article: Probabilistic Analysis of the Capacitated Vehicle Routing Problem with Unsplit Demands
Recommended article: Capacitated vehicle routing with nonuniform speeds
Recommended article: On a capacitated multivehicle routing problem
Recommended article: The robust capacitated vehicle routing problem under demand uncertainty
Recommended article: Capacitated Vehicle Routing with Non-uniform Speeds
Recommended article: On the vehicle routing problem with lower bound capacities
Recommended article: A tight approximation algorithm for multi-vehicle CVRP with unsplittable demands on a line
Recommended article: The capacitated vehicle routing problem with evidential demands
description: scientific article; zbMATH DE number 7595927