Dynasearch algorithms for solving time dependent traveling salesman problem (Q3403334)
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 5670265
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dynasearch algorithms for solving time dependent traveling salesman problem |
scientific article; zbMATH DE number 5670265 |
Statements
12 February 2010
0 references
traveling salesman problem
0 references
dynasearch algorithm
0 references
dynamic programming heuristics
0 references
0.8743643760681152
0 references
0.8391333222389221
0 references
0.8278087377548218
0 references
