| 旅行商问题图论近似算法有效性分析 |
| |
| 引用本文： | 林农. 旅行商问题图论近似算法有效性分析[J]. 东莞理工学院学报, 2012, 19(1): 10-13 |
| |
| 作者姓名： | 林农 |
| |
| 作者单位： | 东莞理工学院计算机学院,广东东莞,523808 |
| |
| 摘 要： | 给出旅行商问题四种图论近似算法及有效性分析,改进第一种近似算法证明,修正第二、三、四种近似算法有效性的上界。
|
| 关 键 词： | 旅行商问题 NP难题 图论 近似算法 算法有效性 |
An Analysis of the Effectiveness of Approximate Algorithms Based on Graph Theory for the Traveling Salesman Problem |
| |
| LIN Nong. An Analysis of the Effectiveness of Approximate Algorithms Based on Graph Theory for the Traveling Salesman Problem[J]. Journal of Dongguan Institute of Technology, 2012, 19(1): 10-13 |
| |
| Authors: | LIN Nong |
| |
| Affiliation: | LIN Nong ( College of Computer, Dongguan University of Technology, Dongguan 523808, China) |
| |
| Abstract: | Based on graph theory and their effectiveness, four approximate algorithms are given, adapting the proof technique of the first, modifying the upper bound of the second, third and fourth . |
| |
| Keywords: | traveling salesman graph theory approximate algorithm effectiveness of algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
