Routing with time windows by column generation (Q3688124)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3912133
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Routing with time windows by column generation |
scientific article; zbMATH DE number 3912133 |
Statements
Routing with time windows by column generation (English)
0 references
1984
0 references
m-traveling salesman
0 references
column generation
0 references
set partitioning
0 references
simplex
0 references
branch-and-bound
0 references
shortest path algorithm
0 references
time windows
0 references
school bus transportation problems
0 references
0.9220001101493835
0 references
0.9021347761154176
0 references
0.8418183922767639
0 references
0.8326888084411621
0 references