On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows (Q4367254)
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: On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows |
scientific article; zbMATH DE number 1091536
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows |
scientific article; zbMATH DE number 1091536 |
Statements
On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows (English)
0 references
25 November 1997
0 references
vehicle routing
0 references
time windows
0 references
set covering
0 references
linear programming relaxation
0 references
column generation
0 references
branch-and-bound
0 references
0.8080293536186218
0 references
0.8021988272666931
0 references
0.7967702150344849
0 references
0.7965538501739502
0 references
