A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem (Q1266514): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0377-2217(94)00299-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1981245140 / rank | |||
Normal rank | |||
Revision as of 02:38, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem |
scientific article |
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
