An exact algorithm with linear complexity for a problem of visiting megalopolises (Q2396369): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1134/s0081543816090054 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2582089955 / rank | |||
Normal rank | |||
Latest revision as of 09:45, 30 July 2024
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
