A tight approximation algorithm for multi-vehicle CVRP with unsplittable demands on a line
DOI10.1007/S11424-022-0280-ZzbMATH Open1502.90029OpenAlexW4283157753WikidataQ114222437 ScholiaQ114222437MaRDI QIDQ2109294FDOQ2109294
Publication date: 20 December 2022
Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11424-022-0280-z
Recommendations
- Capacitated vehicle routing problem on line with unsplittable demands
- Improved approximations for capacitated vehicle routing with unsplittable client demands
- scientific article; zbMATH DE number 1522939
- A new approximation algorithm for the capacitated vehicle routing problem on a tree
- scientific article; zbMATH DE number 1303035
Deterministic network models in operations research (90B10) Approximation algorithms (68W25) Transportation, logistics and supply chain management (90B06)
Cites Work
- The truck dispatching problem
- Minimizing makespan on a single batch processing machine with nonidentical job sizes
- Title not available (Why is that?)
- Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees
- Capacitated Vehicle Routing on Trees
- A new approximation algorithm for the capacitated vehicle routing problem on a tree
- Heuristics for unequal weight delivery problems with a fixed error guarantee
- Capacitated vehicle routing problem on line with unsplittable demands
- Title not available (Why is that?)
- The complexity and on-line algorithm for automated storage and retrieval system with stacker cranes on one rail
- Improved bounds for batch scheduling with nonidentical job sizes
- An approximation of the customer waiting time for online restaurants owning delivery system
Cited In (1)
This page was built for publication: A tight approximation algorithm for multi-vehicle CVRP with unsplittable demands on a line
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2109294)
