A polynomial-time exact algorithm for \(k\)-depot capacitated vehicle routing problem on a tree (Q6483737)
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 polynomial-time exact algorithm for k-depot capacitated vehicle routing problem on a tree |
scientific article; zbMATH DE number 7342128
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial-time exact algorithm for \(k\)-depot capacitated vehicle routing problem on a tree |
scientific article; zbMATH DE number 7342128 |
Statements
A polynomial-time exact algorithm for \(k\)-depot capacitated vehicle routing problem on a tree (English)
0 references
3 May 2021
0 references
0.8439449071884155
0 references
0.8249620199203491
0 references
0.8235068321228027
0 references
