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 this page instead for the normal view: The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time |
scientific article |
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
