Polynomial Time Approximation Scheme for Single-Depot Euclidean Capacitated Vehicle Routing Problem (Q3467845): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:56, 4 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial Time Approximation Scheme for Single-Depot Euclidean Capacitated Vehicle Routing Problem |
scientific article |
Statements
Polynomial Time Approximation Scheme for Single-Depot Euclidean Capacitated Vehicle Routing Problem (English)
0 references
5 February 2016
0 references
capacitated vehicle routing problem
0 references
polynomial time approximation scheme
0 references
iterated tour partition
0 references
