A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem (Q1266514)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem |
scientific article; zbMATH DE number 1208461
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem |
scientific article; zbMATH DE number 1208461 |
Statements
A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem (English)
0 references
7 October 1998
0 references
heuristics
0 references
routing
0 references
transportation
0 references
time dependence
0 references
traveling salesman
0 references
precedence relationships
0 references
0 references
0 references
