The Euclidean vehicle routing problem with multiple depots and time windows (Q1708638)
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: The Euclidean vehicle routing problem with multiple depots and time windows |
scientific article; zbMATH DE number 6852662
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Euclidean vehicle routing problem with multiple depots and time windows |
scientific article; zbMATH DE number 6852662 |
Statements
The Euclidean vehicle routing problem with multiple depots and time windows (English)
0 references
26 March 2018
0 references
modern logistics
0 references
Euclidean Vehicle Routing problem (VRP)
0 references
multiple depots and time windows (MDTW)
0 references
approximation algorithm
0 references
0.8662360310554504
0 references
0.8475326895713806
0 references
0.795010507106781
0 references
