Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows (Q5060801): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1287/ijoc.2022.1236 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1287/IJOC.2022.1236 / rank | |||
Normal rank | |||
Latest revision as of 15:47, 30 December 2024
scientific article; zbMATH DE number 7640794
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
