讨论了货郎问题的计算复杂性，指出了货郎优化问题与货郎判定问题计算复杂性的差异。
This article discusses the computational complexity of Traveling Salesman Problem, and points out the difference of computational complexity between Decisive TSP and Optimal TSP.
讨论了货郎问题的计算复杂性，指出了货郎优化问题与货郎判定问题计算复杂性的差异。
This article discusses the computational complexity of Traveling Salesman Problem, and points out the difference of computational complexity between Decisive TSP and Optimal TSP.
应用推荐