A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes (Q2327675)
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 multi-compartment vehicle routing problem with flexible compartment sizes |
scientific article; zbMATH DE number 7117673
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes |
scientific article; zbMATH DE number 7117673 |
Statements
A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes (English)
0 references
15 October 2019
0 references
vehicle routing
0 references
multiple compartments
0 references
branch-and-cut algorithm
0 references
waste collection
0 references
0 references
0 references
0 references
0 references
0.913713812828064
0 references
0.8580625653266907
0 references
0.8038133978843689
0 references
0.7972774505615234
0 references
