| 求解旅行商问题的两步法 |
| |
| 引用本文： | 焦书清.求解旅行商问题的两步法[J].武警工程学院学报,2010(2):6-7,11. |
| |
| 作者姓名： | 焦书清 |
| |
| 作者单位： | 武警西安指挥学院教研部,陕西西安710038 |
| |
| 摘 要： | 基于度约束最小树算法提出了一个解决旅行商问题的算法（即两步法），针对这一算法我们进行了大量的数据实验，数据实验表明算法是非常有效的。
|
| 关 键 词： | 最小树算法 旅行商问题 两步法 |
Two -step Solution for Traveling Salesman Problem |
| |
| Jiao Shuqing.Two -step Solution for Traveling Salesman Problem[J].Journal of Engineering College of Armed Police Force,2010(2):6-7,11. |
| |
| Authors: | Jiao Shuqing |
| |
| Institution: | Jiao Shuqing (Department of Teaching and Research, Xi＇an Command College of CAPF,Xi＇an 710038 ,China) |
| |
| Abstract: | A two - step solution for traveling salesman problem is proposed on the basis of the degree - constraint minimum spanning tree algorithm. A large number of numerical experiments show that the algorithm is practical and efficient. |
| |
| Keywords: | minimum tree algorithm traveling salesman problem two- step solution |
| 本文献已被 维普 等数据库收录！ |
