Introduction - If you have any usage issues, please Google them yourself
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.