Methods for routing with time windows (Q1068008)
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 3928749
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Methods for routing with time windows |
scientific article; zbMATH DE number 3928749 |
Statements
Methods for routing with time windows (English)
0 references
1986
0 references
transportation
0 references
routing
0 references
m-travelling salesman
0 references
Column generation
0 references
set partitioning
0 references
simplex
0 references
branch-and-bound
0 references
shortest path algorithm
0 references
scheduling
0 references
time windows
0 references
0 references
0.9521302580833436
0 references
0.9220001101493835
0 references
0.8517273664474487
0 references
0.8389665484428406
0 references
