Linear time dynamic-programming algorithms for new classes of restricted TSPs: a computational study (Q2884495)
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: Linear time dynamic-programming algorithms for new classes of restricted TSPs: a computational study |
scientific article; zbMATH DE number 6039048
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear time dynamic-programming algorithms for new classes of restricted TSPs: a computational study |
scientific article; zbMATH DE number 6039048 |
Statements
30 May 2012
0 references
dynamic programming
0 references
algorithms
0 references
complexity
0 references
heuristics
0 references
vehicle routing
0 references
traveling salesman problem
0 references
0.8780795
0 references
0.87111527
0 references
0.8627641
0 references
0.86223733
0 references
0.85776365
0 references
0.8573671
0 references
0.8562558
0 references
0 references
Linear time dynamic-programming algorithms for new classes of restricted TSPs: a computational study (English)
0 references
