{"title":"用相关回归分析方法求解旅行商问题","authors":"V. Shut, I. Prozherin","doi":"10.1109/IDAACS.2001.942028","DOIUrl":null,"url":null,"abstract":"In this paper, the travelling salesman problem and its solution by a method of correlative regression analysis are considered. The mathematical model of the given method is considered. The method allows the problem to be solved by using a minimum memory size of /spl sim/o(n/sup 2/+3n) cells and with a small run time /spl sim/o(n).","PeriodicalId":419022,"journal":{"name":"Proceedings of the International Workshop on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications. IDAACS'2001 (Cat. No.01EX510)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A solution of travelling salesman problem by a method of correlative-regression analysis\",\"authors\":\"V. Shut, I. Prozherin\",\"doi\":\"10.1109/IDAACS.2001.942028\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, the travelling salesman problem and its solution by a method of correlative regression analysis are considered. The mathematical model of the given method is considered. The method allows the problem to be solved by using a minimum memory size of /spl sim/o(n/sup 2/+3n) cells and with a small run time /spl sim/o(n).\",\"PeriodicalId\":419022,\"journal\":{\"name\":\"Proceedings of the International Workshop on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications. IDAACS'2001 (Cat. No.01EX510)\",\"volume\":\"39 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the International Workshop on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications. IDAACS'2001 (Cat. No.01EX510)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IDAACS.2001.942028\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the International Workshop on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications. IDAACS'2001 (Cat. No.01EX510)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IDAACS.2001.942028","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A solution of travelling salesman problem by a method of correlative-regression analysis
In this paper, the travelling salesman problem and its solution by a method of correlative regression analysis are considered. The mathematical model of the given method is considered. The method allows the problem to be solved by using a minimum memory size of /spl sim/o(n/sup 2/+3n) cells and with a small run time /spl sim/o(n).
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
