A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints (Q1754109)
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 6876569
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints |
scientific article; zbMATH DE number 6876569 |
Statements
A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints (English)
0 references
30 May 2018
0 references
cutting
0 references
branch and cut
0 references
polyhedral combinatorics
0 references
two-echelon vehicle routing
0 references
0 references
0 references
0 references
0.8578707575798035
0 references
0.8553255796432495
0 references
0.8203692436218262
0 references
0.8077921271324158
0 references
0.8073760867118835
0 references
