An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem (Q2337401)
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 improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem |
scientific article; zbMATH DE number 7132702
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem |
scientific article; zbMATH DE number 7132702 |
Statements
An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem (English)
0 references
19 November 2019
0 references
two-echelon vehicle routing
0 references
valid inequalities
0 references
branch-cut-and-price
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8922224640846252
0 references
0.8815767765045166
0 references
0.8590722680091858
0 references
0.8578707575798035
0 references
0.8349131345748901
0 references
