Reachability cuts for the vehicle routing problem with time windows (Q2432846)
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: Reachability cuts for the vehicle routing problem with time windows
scientific article; zbMATH DE number 5067611
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reachability cuts for the vehicle routing problem with time windows |
scientific article; zbMATH DE number 5067611 |
Statements
Reachability cuts for the vehicle routing problem with time windows (English)
0 references
25 October 2006
0 references
routing
0 references
time windows
0 references
precedence constraints
0 references
0.8938910365104675
0 references
0.8287444114685059
0 references
0.8057705760002136
0 references
0.790147602558136
0 references
0.7890135049819946
0 references
