货郎担问题的新解法及其算法设计

A New Solution of Travelling Salesman Problem and the Design of Its Algorithm

货郎担问题是运筹学中的一个著名命题，目前使用分技定界法及动态规划方法求解．本文介绍使用元素判别值进行求解的新方法及其算法设计和程序实现，它比现行方法简易有效．

As a famous proposition in operation research,travelling salesman problem is solved by branch bound method and the method of dynamic programming at present.The author proposes a new method of element discrimination value with its algorithm design and program execution. The new method is proved to be simpler and more efficient than the existing ones.