Introduction - If you have any usage issues, please Google them yourself
Algorithm design and analysis of task allocation problem. When the solution of the problem using backtracking, with a completely n-tree represents the solution space. Feasibility cut does not meet the conditions select rows, columns, constraints subtree. Recursive method backtrack (1) to achieve the entire solution space backtracking search backtrack (i) the search of the solution space of the i-layer sub-tree, sum the number of records feasible solutions currently found. In the algorithm backtrack, when i> n, the algorithm searches to leaf node, the current program has been found feasible to add a number of sum When i < = n, the current expansion node Z is an internal node in the solution space. The node has x [i] = 1,2, ..., n of n son nodes. For each son node Z' s current expansion node, check its feasibility by the select method, and depth-first manner subtree recursively search for feasible or infeasible cut subtree.