Capacitated vehicle routing problem on line with unsplittable demands (Q2082210)
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: Capacitated vehicle routing problem on line with unsplittable demands |
scientific article; zbMATH DE number 7595927
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Capacitated vehicle routing problem on line with unsplittable demands |
scientific article; zbMATH DE number 7595927 |
Statements
Capacitated vehicle routing problem on line with unsplittable demands (English)
0 references
4 October 2022
0 references
vehicle routing
0 references
worst-case analysis
0 references
network
0 references
approximation algorithm
0 references
0.9292623
0 references
0.9197377
0 references
0.9135262
0 references
0.8971214
0 references
0.8970834
0 references
0.8969805
0 references
0.8957686
0 references
0.89536834
0 references
0 references
