Exact algorithms for the double vehicle routing problem with multiple stacks (Q342039)
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 6654026
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact algorithms for the double vehicle routing problem with multiple stacks |
scientific article; zbMATH DE number 6654026 |
Statements
Exact algorithms for the double vehicle routing problem with multiple stacks (English)
0 references
17 November 2016
0 references
vehicle routing problem
0 references
one-to-one pickup-and-delivery
0 references
last-in-first-out
0 references
branch-and-cut
0 references
branch-and-price-and-cut
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9179014
0 references
0.9136547
0 references
0.91040605
0 references
0.9071585
0 references
0.8999719
0 references
0.8996538
0 references
0 references
0 references
0.8884958
0 references
