A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem (Q2494814)
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 5038123
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem |
scientific article; zbMATH DE number 5038123 |
Statements
A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem (English)
0 references
30 June 2006
0 references
traveling salesman problem
0 references
very large-scale neighborhood search
0 references
dynamic programming
0 references
0 references
0 references
0 references
0.7917410731315613
0 references
0.7842552661895752
0 references
0.7842548489570618
0 references
