{"title":"非对称旅行商问题的多项式随机算法","authors":"M. Barketau","doi":"10.29235/1561-8323-2022-66-5-489-494","DOIUrl":null,"url":null,"abstract":"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. ","PeriodicalId":41825,"journal":{"name":"DOKLADY NATSIONALNOI AKADEMII NAUK BELARUSI","volume":" ","pages":""},"PeriodicalIF":0.1000,"publicationDate":"2022-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Polynomial randomized algorithm for the asymmetric travelling salesman problem\",\"authors\":\"M. Barketau\",\"doi\":\"10.29235/1561-8323-2022-66-5-489-494\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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. \",\"PeriodicalId\":41825,\"journal\":{\"name\":\"DOKLADY NATSIONALNOI AKADEMII NAUK BELARUSI\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.1000,\"publicationDate\":\"2022-11-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"DOKLADY NATSIONALNOI AKADEMII NAUK BELARUSI\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.29235/1561-8323-2022-66-5-489-494\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MULTIDISCIPLINARY SCIENCES\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"DOKLADY NATSIONALNOI AKADEMII NAUK BELARUSI","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.29235/1561-8323-2022-66-5-489-494","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MULTIDISCIPLINARY SCIENCES","Score":null,"Total":0}
Polynomial randomized algorithm for the asymmetric travelling salesman problem
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.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
