Lifted and local reachability cuts for the vehicle routing problem with time windows (Q336427)
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: Lifted and local reachability cuts for the vehicle routing problem with time windows |
scientific article; zbMATH DE number 6650444
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lifted and local reachability cuts for the vehicle routing problem with time windows |
scientific article; zbMATH DE number 6650444 |
Statements
Lifted and local reachability cuts for the vehicle routing problem with time windows (English)
0 references
10 November 2016
0 references
vehicle routing problem with time windows
0 references
mixed integer programming
0 references
branch and cut
0 references
0 references
0 references
0 references
0 references
0.8938910365104675
0 references
0.874064028263092
0 references
0.8575171828269958
0 references
0.8449862003326416
0 references
0.8296880722045898
0 references
