The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time (Q1991101)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6968039
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time |
scientific article; zbMATH DE number 6968039 |
Statements
The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time (English)
0 references
30 October 2018
0 references
vehicle routing
0 references
integer programming
0 references
column generation
0 references
0 references
0 references
0 references
0.8370271921157837
0 references
0.8351423144340515
0 references
0.8335880637168884
0 references
0.8335513472557068
0 references
