中国旅行商问题是一个著名的组合优化问题。本文从该问题的描述方法着手,提出用二叉树表示该问题中所有城市的相互关系的观点,并详细介绍了这一方法的具体实现过程。在此基础上,本文说明了如何由树根至树叶求解中国旅行商问题。采用本文方法求得的结果优于许多文献所发表的结果。本文的方法对求解许多其它旅行商问题也取得了令人满意的结果。 China Traveling Salesman Problem is a famous combinatorial optimization problem. Starting with the description of the problem, this paper proposes a binary tree that expresses the relationship between all cities in the problem and details the implementation of this method. On this basis, this article shows how to solve the Chinese traveling salesman problem from roots to leaves. The results obtained by this method are superior to those published in many literatures. The method in this paper has also yielded satisfactory results for solving many other traveling salesman problems.