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
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study |
scientific article |
Statements
Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study (English)
0 references
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
