An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts (Q948965)
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: An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts |
scientific article; zbMATH DE number 5351844
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts |
scientific article; zbMATH DE number 5351844 |
Statements
An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts (English)
0 references
16 October 2008
0 references
vehicle routing
0 references
set partitioning
0 references
dual ascent
0 references
valid inequalities
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.96338224
0 references
0.8834388
0 references
0.8817075
0 references
0.8811227
0 references
0.87948847
0 references
0.8770572
0 references
0.8765375
0 references
