A tight approximation algorithm for multi-vehicle CVRP with unsplittable demands on a line (Q2109294)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A tight approximation algorithm for multi-vehicle CVRP with unsplittable demands on a line |
scientific article; zbMATH DE number 7635193
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A tight approximation algorithm for multi-vehicle CVRP with unsplittable demands on a line |
scientific article; zbMATH DE number 7635193 |
Statements
A tight approximation algorithm for multi-vehicle CVRP with unsplittable demands on a line (English)
0 references
20 December 2022
0 references
approximation algorithm
0 references
network
0 references
unsplittable demand
0 references
vehicle routing
0 references
worst-case analysis
0 references
0 references
0 references
0.9056798815727234
0 references
0.8579815626144409
0 references
0.7994638681411743
0 references
