摘要
在旅行商问题传统的分支限界法基础上提出一个新的方法,最后用算例检验了该方法能有效地求得最优解.
A new method based on traditional branch and bound algorithm for the traveling salesman problem was proposed in this paper, the example show that the optimal solution will be given efficiently.
出处
《洛阳师范学院学报》
2011年第8期72-73,共2页
Journal of Luoyang Normal University
关键词
旅行商问题
分支限界法
有效性
traveling salesman problem
branch and bound algorithm
efficiency
