The travelling salesman problem was used to illustrate NP - hard problems.

旅行商问题的是用来说明NP难问题.

互联网

Due to its non - linear and NP hard, classical optimizing approaches can not solve it.

由于其所具有的非线性、NP难 等复杂特性, 常规方法难以求解.

互联网

The model is in fact a special type of classic location - allocation models and has NP - hard complexity.

该模型是一种特殊形式的选择 —分 配模型,具有NP难性质.

互联网

For general graph, a NP - hard question to get the bondage number or reinforcement number.

对一般的图, 求其绑定数和增强数是NP - 困难问题,在本文中我们求出了两类图的绑定数和增强数.

互联网

The corresponding protein structure prediction problems, however, are still concluded to be NP - hard problems.

尽管如此, 其相应的蛋白质结构预测问题仍然是具有NP难度的.

互联网