On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows (Q4367254): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 23:38, 6 February 2024
scientific article; zbMATH DE number 1091536
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
