A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints (Q2140338)
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 vehicle routing problem with two-dimensional loading constraints |
scientific article; zbMATH DE number 7530102
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints |
scientific article; zbMATH DE number 7530102 |
Statements
A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints (English)
0 references
20 May 2022
0 references
routing
0 references
two-dimensional loading constraints
0 references
branch and cut
0 references
contraction algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9173392653465272
0 references
0.848085343837738
0 references
0.8321923613548279
0 references
0.8297768831253052
0 references
