摘要
货郎担问题 (TSP)属于典型的组合优化问题 ,研究TSP问题具有典型意义。本文讨论了具有三角不等式性质的TSP问题的近似算法及其时间性能 ,并对此算法在一般的TSP问题下的时间性能进行了分析。
The traveling salesman problem belongs to a pattern unite problem.It has a pattern meaning to research TSP.This paper discuses the approximate algorithm of TSP which has property of not equilateral triangle,as same as its performance analysis is done,and its performance in general circumstances is analysed.
出处
《长春大学学报》
2001年第6期17-19,共3页
Journal of Changchun University
关键词
三角不等式
货郎担问题
近似算法
traveling salesman problem
non equilateral triangle
approximate algorithm
