由于该问题是NP -完备的，我们给出了一个启发式算法。
Because of NP property, we will propose an heuristic algorithm to solve the problem.
由于TSP问题在理论上属于NP完备问题，很难用一般的算法求解。
Because TSP is known to be a NP - complete problem in theory, it is too difficult to be solved with traditional optimal methods.
首先，研究了在不完备信息系统下的属性约简算法。
Firstly, the attributes reduction algorithm is studied under the incomplete information systems.
应用推荐