An exact algorithm with linear complexity for a problem of visiting megalopolises (Q2396369)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An exact algorithm with linear complexity for a problem of visiting megalopolises |
scientific article |
Statements
An exact algorithm with linear complexity for a problem of visiting megalopolises (English)
0 references
8 June 2017
0 references
traveling salesman problem
0 references
NP-hard problem
0 references
dynamic programming
0 references
precedence relations
0 references
0 references
0 references
0 references
0 references
