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 |
Normalize DOI. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1287/opre.45.2.295 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/opre.45.2.295 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1966891017 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1287/OPRE.45.2.295 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 22:30, 29 December 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
