Solving TSP Based on Multi-Segment Multi-Orientation Nearest Neighbor Algorithm | |
Xiang Zuo-Yong; Gao Xing-Yu; Chen Zhen-Yu; Ouyang Liu-Bo; Chen Duan-Lai | |
会议名称 | 2010 IEEE 智能计算与智能系统国际会议 ICIS 2010 |
会议日期 | 2010 |
会议地点 | 厦门 |
关键词 | TSP construction algorithm NN search k-nearest neighbor multi-orientation nearest neighbor |
会议录 | 2010 IEEE 智能计算与智能系统国际会议 ICIS 2010论文集
![]() |
URL标识 | 查看原文 |
内容类型 | 会议论文 |
URI标识 | http://www.corc.org.cn/handle/1471x/6521328 |
专题 | 湖南大学 |
作者单位 | School of Science,Central South University of Forestry and \'Tech.,Changsha,Hunan,China;College of Information Engineering.Xiangtan University,Xiangtan,Hunan,China;Institute of Computing Technology.Chinese Academy of Sciences,Beijing,China;School of Software,Hunan University,Changsha,China;School of Math and Computing Science.Hunan University of Sci and Tech.,Hunan,China |
推荐引用方式 GB/T 7714 | Xiang Zuo-Yong,Gao Xing-Yu,Chen Zhen-Yu,et al. Solving TSP Based on Multi-Segment Multi-Orientation Nearest Neighbor Algorithm[C]. 见:2010 IEEE 智能计算与智能系统国际会议 ICIS 2010. 厦门. 2010. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论