Multiprocessor Scheduling Problem ( MSP ) is one of the basic problems in "The Design and Analysis of computer Algorithms" , and is a NP-Problem.
多处理机调度问题是“算法设计与分析”中的基本问题之一，它是一个NP问题。
The vehicle-scheduling problem with time window is also a NP-hard problem being more complicated than VSP.
带有时间窗的车辆优化调度问题是比VSP复杂程度更高的NP难题。
Most of the research in Computer Science these days is devoted to time efficiency, particularly the theoretical time barrier of NP-Complete problems (like the Traveling Salesman problem).
不过现如今的许多计算机科学研究更加关注时间效率，特别是NP完全问题中的理论时间边界(比如旅行商人问题，这是完全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难题。
Coloring of conflict graphs has been used in high level synthesis to map operators, values and data transfers onto Shared resources, however, finding a minimum sized coloring is NP hard problem.
高层次综合中通过对冲突围着色方式把操作、变量值、数据传输映射到共享资源中，然而寻找图着色所需的最小颜色数目是个NP难题。
Because of NP property, we will propose an heuristic algorithm to solve the problem.
由于该问题是NP -完备的，我们给出了一个启发式算法。
In principle, by putting a set of entangled qubits into a suitably tuned magnetic field, the optimal solution to a given NP-complete problem can be found in one shot.
基本上，通过将一组纠缠的量子放置于一适宜调谐的磁场中，那么给定的NP完全问题的最佳解决方案就可以立马搞定。
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问题”——的最新解答。
Integer Programming is a famous NP hard problem. This paper presents a new algorithm, in which the method of similar dimidiate is adopted.
整数规划是NP困难的经典问题之一，将传统的二分搜索方法推广应用到整数规划的解空间中，提出一种求解整数规划的新算法。
But the attribute reduction is a NP problem, the attribution reduction and decision rule reduction will be solved by method of elicitation.
但是属性约简是一个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问题，在工业界具有广泛的需求。
Sequence alignment is a NP Complete problem and a great challenge to any quick and accurate algorithms.
多序列比对问题是NP完全问题，研究快而精确的算法是一个巨大的挑战。
In the last, the paper designs and analyses the Graph Theory algorithm and drives a conclusion that the problem of the arranging of curriculum schedule is NP - hard problem.
在文章的最后我们对课表超图的图论算法进行设计与分析，并得出该问题是一个NP难问题。
The crossing number of graph, which is an NP-complete problem, has an important theory meaning.
图的交叉数问题属于NP -困难问题，对它的研究有重要的理论意义。
The fill in problem for graphs is a well known NP hard problem.
图的最小填充问题是熟知的NP-困难问题。
Assuming you are looking for general case answer, I am sorry to say - but this problem is NP-Complete.
假设你正在寻找的答案一般情况下，我很抱歉，但是这个问题NP完全。
But it is a NP-Hard problem to get the minimal attribute reduction.
但求取任意问题的最小属性集是一个NP难问题。
Because TSP is known to be a NP - complete problem in theory, it is too difficult to be solved with traditional optimal methods.
由于TSP问题在理论上属于NP完备问题，很难用一般的算法求解。
It is very difficult to solute NP problem with current technology because the set of feasible solutions is very huge.
NP问题的解空间太大导致利用现有技术求解十分困难。
Three-dimensional component packing is a combinatorial optimization and NP-complete problem. It is difficult to find its exact global optimum.
三维布局问题属于组合最优化问题和NP完全问题，在一定时间内求其精确全局最优解是相当困难的。
The minimal vertex - covering problem of graph is a NP-complete problem of graph theory.
图的最小顶点覆盖问题是图论中的一个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 transport problem with fixed charge is a kind of NP problem, and there is no polynomial algorithm which can solve it.
带固定费用的运输问题是一类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完全问题。
The Capacitated Plant Location Problem (CPLP) is a NP problem and hard to get an optimal and satisfactory solution.
容量受限的工厂选址问题属于NP难题，较难得到最优解和满意解。
The problem of maximizing total weighted satisfaction level for single machine with fuzzy due-date is a NP-hard problem.
单机模糊交货期总加权满意程度最大化问题是一个NP -难问题。
Graph Coloring problem (GCP) is an NP hard problem.
图着色问题(GCP)是NP完全问题。
Job shop scheduling is a complex NP problem, scheduling system need considerable flexibility mechanism.
车间调度问题是一个复杂的NP问题，车间调度系统需要具有相当的柔性机制。
Job shop scheduling is a complex NP problem, scheduling system need considerable flexibility mechanism.
车间调度问题是一个复杂的NP问题，车间调度系统需要具有相当的柔性机制。
应用推荐