节点文献
货郎担问题的近似算法
Approximate algorithm of traveling salesman problem
【摘要】 货郎担问题 (TSP)属于典型的组合优化问题 ,研究TSP问题具有典型意义。本文讨论了具有三角不等式性质的TSP问题的近似算法及其时间性能 ,并对此算法在一般的TSP问题下的时间性能进行了分析。
【Abstract】 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.
【关键词】 货朗担问题;
三角不等式;
近似算法;
【Key words】 traveling salesman problem; non equilateral triangle; approximate algorithm;
【Key words】 traveling salesman problem; non equilateral triangle; approximate algorithm;
- 【文献出处】 长春大学学报 ,Journal of Changchun University , 编辑部邮箱 ,2001年06期
- 【分类号】TP301.6
- 【被引频次】2
- 【下载频次】278