Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study (Q2884495): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 20:31, 3 February 2024
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