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 this page instead for the normal view: A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints |
scientific article; zbMATH DE number 6876569
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
