The vehicle-scheduling problem with time window is also a NP-hard problem being more complicated than VSP.
带有时间窗的车辆优化调度问题是比VSP复杂程度更高的NP难题。
Maximum power estimation is a NP-hard problem.
最大功耗估计问题是一个NP难题。
The max-cut problem is a standard NP-hard problem in graph graphic theory.
最大割问题是图论中的一个典型的NP困难问题。
Layout optimization is an NP-hard problem. It also belongs to complex nonlinear constrained optimization problem.
布局优化是NP难问题，也是复杂的非线性约束优化问题。
It is difficult to solve in large scale because the LRP is a typical NP-hard problem in combinatorial optimization.
由于定位-车辆路线问题是组合优化问题中一个典型的NP难题，大规模时难以精确求解。
The problem of maximizing total weighted satisfaction level for single machine with fuzzy due-date is a NP-hard problem.
单机模糊交货期总加权满意程度最大化问题是一个NP -难问题。
Attribute reduction in rough set theory is a NP-hard problem, which is studied mainly to design a more efficient algorithm.
粗糙集的属性约简是一个NP难问题，获得较为高效的算法是研究的主要目的。
Vehicle routing problem with soft time Windows (VRPSTW) is a variation of vehicle routing problem (VRP), which is a typical NP-hard problem.
带软时间窗的车辆路径问题(VRPSTW)是在基本的车辆路径问题(VRP)上增加了时间窗约束条件的一种变化形式，是一个典型的NP -难问题。
In complexity theory, set packing problems is an important NP-hard problem, which is used widely in the fields of scheduling and code optimization.
在复杂性理论中，此问题是一类重要的NP难问题，被广泛应用于调度、代码优化和生物信息学等领域。
Analysis of reliability to the complex network is a NP-Hard problem. Searching for simple and accurate approximation algorithms has high application value.
大型复杂网络的可靠性分析都是NP难题，寻求计算简单、准确的近似算法更具应用价值。
As the task allocation problem is a recognized NP-hard problem, constructing effective approximation algorithms ro heuristic algorithms is a research focus.
由于任务分配问题是NP困难问题，构造有效的近似算法或启发式算法是目前研究的热点。
Resource allocation and task scheduling of Grid is an NP-hard problem. Ant algorithm has proved to be a kind of effective algorithm to solve this kind of problems.
网格环境下的资源分配与调度是一个NP难问题，蚂蚁算法是解决这类问题的有效算法。
As a combinatorial optimization problem, three dimension packing problem with multi-constraints is NP-HARD problem. It is very difficult to obtain an optimal solution.
作为一类组合优化问题，多约束条件下的三维装载问题属于NP - Hard问题，其求解也是相当困难的。
Finding an optimal scheduling for such an environment is a NP-hard problem, and so heuristic approaches must be used in general to get an optimal approximation solution.
由于在这样的环境中找到一个最优的调度是一个NP难问题，通常运用各种启发式算法来找到近似最优解。
The minimum labeling spanning tree(MLST) problem is an NP-hard problem in which, given a graph with labeled edges, one seeks a spanning tree with the least number of labels.
最小标记生成树就是其中之一，它的目标是给出一个边上带有颜色的图，计算使用颜色种类最少的生成树。
The minimum attributes reduction set is expected to acquire the brief regulated set. This is taken as NP-hard Problem, which can be figured out through the heuristic algorithm.
为了获得简明的规则集，通常希望能找出最小的属性约简集，而求解最小约简是NP难问题，解决此类难题通常采用启发式算法以求得近似最优解。
But the RWA in mesh networks is a NP-hard problem which can not be solved optimally with exhaustive search in the endurable time. Hence, we designed a heuristic algorithm to solve it.
而格状网络中的RWA是个NP -难问题，它不可能在有限的时间内通过穷举搜索来获得其优化解，为此我们设计了一个启发性算法以解决这个问题。
The black and white salesman problem (BWTSP) is a new NP-hard problem, which can be divided into the undirected BWTSP and the directed BWTSP according to the symmetry of edges in graph.
黑白旅行商问题(BWTSP)是近年来出现的新NP -难解问题，根据图中边是否对称可以分为无向BWTSP和有向BWTSP两种。
MultiDepot Open Vehicle Routing Problem with soft time windows is a variation of the Vehicle Routing Problem con- strained by multidepot and soft time windows, which is a typical NP-hard problem.
有软时窗约束多车场开放式车辆路径问题是在基本的车辆路径问题上增加了时间窗约束和多车场作业的一种变化形式，是一个典型的NP-难问题。
Three dimension packing problem with multi constraints is a complicated combinatorial optimization, and is NP HARD problem. It is difficult to obtain on optimal solution.
多约束条件下的三维装箱问题是一个复杂的组合优化问题，属于NP- HARD问题，其求解是很困难的。
Optimization of system reliability is a NP hard problem, and people can not find the precise method for result.
系统可靠性优化已被证明是一个NP完全问题，不存在精确的求解方法。
Strip layout is the key procedure in progressive die design, it is known as a NP hard problem.
级进模工步排样是级进模设计的核心，理论上属NP完全问题。
Attribute reduction of rough sets is an NP hard problem, but there is not a popular efficient algorithm presently.
粗糙集的属性约简是一个NP难的问题，但没有一个目前流行的有效的算法。
Absrtact: Task scheduling algorithm has been proved to be a NP hard problem in the dynamic, heterogeneous and complicated grid environment.
摘要：在动态、异构的复杂网格环境中，任务调度算法已被证明是一个NP难问题。
Because the planning problem includes integral constrains and nonlinear constrains, it is always a NP hard problem.
此类规划问题包含有大量的整数规划及非线性约束，因而被广泛认为是一类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困难的经典问题之一，将传统的二分搜索方法推广应用到整数规划的解空间中，提出一种求解整数规划的新算法。
Vehicle scheduling problem with non full load is a fundamental problem of vehicle scheduling problem. Because it is a typical NP hard problem, traditional algorithms usually are not satisfied.
非满载车辆调度问题是车辆调度问题中的一个基本问题，由于它是一个典型的NP难题，传统方法的求解结果往往不能令人满意。
The connected augmentation of weighted graphs is NP hard problem that has been proved.
加权图的连通扩充问题已被证明是NP完全问题。
The connected augmentation of weighted graphs is NP hard problem that has been proved.
加权图的连通扩充问题已被证明是NP完全问题。
应用推荐