0-1整数规划有很广泛的应用背景，比如指派问题，背包问题等等，实际上TSP问题也是一个0-1问题，当然这些问题都是NP问题，对于规模较大的问题用穷举法是没有办法在可接受的时间内求得最优解的，本程序只不过是一个练习，得意之处是用递归法把所有解都排列出来。(0-1 integer programming has a very wide application background, such as assignment problem, knapsack problem and so on. In fact, TSP problem is also a 0-1 problem. Of course, these problems are NP problems. For large-scale problems, exhaustive method is unable to find the optimal solution in an acceptable time. This program is only an exercise, and the proud point is that all solutions are arranged by recursive method. Come out.)