Exact algorithms for the multi-pickup and delivery problem with time windows (Q2178121)
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 7197989
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact algorithms for the multi-pickup and delivery problem with time windows |
scientific article; zbMATH DE number 7197989 |
Statements
Exact algorithms for the multi-pickup and delivery problem with time windows (English)
0 references
7 May 2020
0 references
vehicle routing problem
0 references
multi-pickup and delivery problem
0 references
sequential ordering problem
0 references
branch-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.8735063076019287
0 references
0.856025218963623
0 references
0.8559426069259644
0 references
0.8296626806259155
0 references
0.8123630881309509
0 references
