Programmers and computer scientists have been buzzing for the past week about the latest attempt to solve one of the most vexing questions in computer science: the so-called "p versus NP problem."
程序员与计算机科学家上周都在热议对计算机科学中最令人困惑的问题——所谓的“P与NP问题”——的最新解答。
Reduction and core are two important concepts in rough set theory, while computing reductions and core according to the definitions directly is a typical NP problem.
约简与核是粗糙集理论的两个重要概念，而直接由定义来计算约简与核是一个典型的NP难题。
From calculation point of view, machines and parts classification is NP problem in nature.
从计算的观点来看，机床零件分组本质上是NP问题。
Blanking layout is a NP problem, and is widely needed in the industry.
冲裁件的排样是一个NP问题，在工业界具有广泛的需求。
But the attribute reduction is a NP problem, the attribution reduction and decision rule reduction will be solved by method of elicitation.
但是属性约简是一个NP问题，对属性的约简和决策规则的约简只能通过启发式算法实现。
It is very difficult to solute NP problem with current technology because the set of feasible solutions is very huge.
NP问题的解空间太大导致利用现有技术求解十分困难。
The Capacitated Plant Location Problem (CPLP) is a NP problem and hard to get an optimal and satisfactory solution.
容量受限的工厂选址问题属于NP难题，较难得到最优解和满意解。
Job shop scheduling is a typical NP problem.
车间作业调度是典型的NP难题。
The transport problem with fixed charge is a kind of NP problem, and there is no polynomial algorithm which can solve it.
带固定费用的运输问题是一类NP难题，没有多项式算法可以求解。
Vehicle Routing problem (VRP) is a combination optimization problem in transportation logistics, which has been applied in many fields. It is a strong NP problem.
车辆路径问题是一类在物流配送调度中具有广泛应用的组合优化问题，属于强np难题。
TSP is a combinational optimization problem which has wide application background and important theory value, and it belongs to classical NP problem.
TSP问题是一个具有广泛的应用背景和重要理论价值的组合优化问题，属于典型的NP问题。
The TSP problem is considered as classical optimization grouping problem, which is widely used in practice, but it is real a difficult NP problem.
旅行商问题作为经典的组合优化问题，实际中的应用非常广泛，但它却是一个NP完全问题。
Job shop scheduling is a complex NP problem, scheduling system need considerable flexibility mechanism.
车间调度问题是一个复杂的NP问题，车间调度系统需要具有相当的柔性机制。
Timetable problem is a typical problem of combined optimization in the fields of operational research and systems engineering, which belongs to NP problem.
时间表问题是运筹学领域和系统工程领域中的典型组合优化问题，是由于事件对时间和空间的资源争夺而产生的，属于NP完全类问题。
Because the location model is an NP problem, we solve the problem with heuristic arithmetic.
由于选址模型是NP问题，采用启发式算法进行求解。
The model belongs to mixed 0-1 integer programming model and is NP problem, the more difficult to solve directly.
该模型为混合0 - 1整数规划模型，属于NP问题，直接求解较困难。
The resource-constrained project scheduling problem (RCPSP) is NP problem, most of commercial project management software usually employ simple priority rules for solving the problem.
资源平衡优化问题即资源有限项目调度问题，是一个NP难问题，现在商用项目管理软件系统中的资源平衡优化问题多采用基于优先规则的启发式算法。
Multiprocessor Scheduling Problem ( MSP ) is one of the basic problems in "The Design and Analysis of computer Algorithms" , and is a NP-Problem.
多处理机调度问题是“算法设计与分析”中的基本问题之一，它是一个NP问题。
Because the Causality Diagram's reasoning calculation is a NP problem, it is inconvenient in its popularization and application.
由于因果图的经典推理的计算复杂度是NP难的，不便于推广和使用。
Because the Causality Diagram's reasoning calculation is a NP problem, it is inconvenient in its popularization and application.
由于因果图的经典推理的计算复杂度是NP难的，不便于推广和使用。
应用推荐