An exact algorithm with linear complexity for a problem of visiting megalopolises

Original language	English
Pages (from-to)	38-46
Number of pages	9
Journal	Proceedings of the Steklov Institute of Mathematics
Volume	295
DOIs	https://doi.org/10.1134/S0081543816090054
Publication status	Published - 1 Dec 2016

dynamic programming, NP-hard problem, precedence relations, traveling salesman problem

ID: 1478869