Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW (Q4319776): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| 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.42.5.977 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2156117830 / rank | |||
Normal rank | |||
Latest revision as of 19:16, 19 March 2024
scientific article; zbMATH DE number 710940
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW |
scientific article; zbMATH DE number 710940 |
Statements
Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW (English)
0 references
12 January 1995
0 references
vehicle routing with time windows
0 references
relaxation approach
0 references
set partition
0 references
