Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows (Q5060801)
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 7640794
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows |
scientific article; zbMATH DE number 7640794 |
Statements
Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows (English)
0 references
11 January 2023
0 references
traveling salesman problem
0 references
time-dependent travel times
0 references
time windows
0 references
dynamic programming
0 references
state-space relaxation
0 references
completion bounds
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8126144409179688
0 references
0.7986689209938049
0 references
0.7931860685348511
0 references
