{"title":"具有柔性颜色的旅行商问题分析","authors":"T. Roemer, R. Ahmadi, S. Dasu","doi":"10.2139/ssrn.1571842","DOIUrl":null,"url":null,"abstract":"This paper analizes a new variant of the Traveling Salesman Problem (TSP) in which nodes belong to various color classes and each color class must be visited as an entity. We show that the problem is APX-hard and provide exact solutions for special cases and a two-phase heuristic for the general case. Lastly, we analyze the worst case and asymptotic performanc of the heuristic.","PeriodicalId":332226,"journal":{"name":"USC Marshall School of Business Research Paper Series","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Analysis of the Traveling Salesman Problem with Flexible Colors\",\"authors\":\"T. Roemer, R. Ahmadi, S. Dasu\",\"doi\":\"10.2139/ssrn.1571842\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper analizes a new variant of the Traveling Salesman Problem (TSP) in which nodes belong to various color classes and each color class must be visited as an entity. We show that the problem is APX-hard and provide exact solutions for special cases and a two-phase heuristic for the general case. Lastly, we analyze the worst case and asymptotic performanc of the heuristic.\",\"PeriodicalId\":332226,\"journal\":{\"name\":\"USC Marshall School of Business Research Paper Series\",\"volume\":\"44 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"USC Marshall School of Business Research Paper Series\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2139/ssrn.1571842\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"USC Marshall School of Business Research Paper Series","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2139/ssrn.1571842","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Analysis of the Traveling Salesman Problem with Flexible Colors
This paper analizes a new variant of the Traveling Salesman Problem (TSP) in which nodes belong to various color classes and each color class must be visited as an entity. We show that the problem is APX-hard and provide exact solutions for special cases and a two-phase heuristic for the general case. Lastly, we analyze the worst case and asymptotic performanc of the heuristic.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
