摘要
“货郎担问题”是不少学者研究的世界难题之一。本文指出了“货郎担问题”的描述及经典解法与实际应用上的差距，从而给出与实际应用相符合的“货郎担问题”的新定义及其有效的算法，从而使该问题更具有重要的实用价值。
The Traveling Salesman Problem(TSP) is one of the most difficult problems that many scholars all over the world are studying.This paper points out the disparity between the definition and the classical solution of TSP and its practical applications,and then presents a new definition of TSP and its effective algorithm conforming to practical applications,thus making TSP practically more valuable.
出处
《重庆邮电学院学报（自然科学版）》
1999年第2期5-8,共4页
Journal of Chongqing University of Posts and Telecommunications(Natural Sciences Edition)
