Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks (Q322560)
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 6636089
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks |
scientific article; zbMATH DE number 6636089 |
Statements
Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks (English)
0 references
7 October 2016
0 references
vehicle routing with pickups and deliveries
0 references
loading constraints
0 references
column generation
0 references
branch-price-and-cut
0 references
valid inequalities
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8876125812530518
0 references
0.8698229193687439
0 references
0.8661090135574341
0 references
0.8623197674751282
0 references
