Polynomial randomized algorithm for the asymmetric travelling salesman problem

Autor:	M. S. Barketau
Rok vydání:	2022
Zdroj:	Doklady of the National Academy of Sciences of Belarus. 66:489-494
ISSN:	2524-2431 1561-8323
DOI:	10.29235/1561-8323-2022-66-5-489-494
Popis:	The asymmetric travelling salesman problem without metric restrictions is considered. The randomized algorithm is proposed. It has a certain approximation guarantee and possesses a certain property regarding the probabilities of the tours built. The computational complexity of the algorithm is polynomial and affordable.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::5ef85d571aa6dd3c1082d2bb529c8eed https://doi.org/10.29235/1561-8323-2022-66-5-489-494 Zobrazit plný text záznamu