大家在查： darkening sleeplessness 王家瑞 cadets PK 下女 hashed 吔重新引导 deflationary

NP-complete

网络哈密尔顿回路问题；最小哈密尔顿回路问题；非多项式完全问题

NP-complete

网络释义

NP-complete

哈密尔顿回路问题

• 最小哈密尔顿回路问题 (NP-complete) • 哈密尔顿路径：包含图中所有点的路径 • 为什么说找两点间的最长路是非常困难的问题？

最小哈密尔顿回路问题

-经济PPT模板免费下载-... ... 6.6.1 哈密尔顿回路( Hamiltonian circuit) 最小哈密尔顿回路问题( NP-complete) ...

非多项式完全问题

摘要:解决多故障定位的非多项式完全问题(NP-complete)在P比特级光网络中变的更加困难。计算复杂度、计算时间与网络的输 …

旅行商问题

matrix 写道 "旅行商问题（ NP-complete）是计算机科学中尚未解决的最为重要的问题之一，而P/NP问题也被列为千禧年7大难 …

例句：

Computing the crossing number of a given graph is NP-complete the crossing number of only a few families of graphs are known.

计算图的交叉数问题被证明是 NP-完全问题，能确定具体交叉数的图类也比较少。

They have discovered that the task falls into a notorious category of problems called NP -complete .

因为他们发现这个问题正是以耗时而闻名的 NP 完备（NP-complete ）问题。

The results indicate that the proposed algorithm can quickly obtain the satisfactory solutions of this type of NP -complete problems .

实验结果表明，该算法能在较短时间内给出这类 NP 完备问题的满意解。

To the best of our current knowledge , there are no exact solutions to problems that are NP Complete .

按照目前的知识，NP 完全问题没有精确解。

It have been proved that RWA (routing and wavelength assignment ) algorithm in arbitrary mesh optical networks is a NP-complete problem .

光网络中的路由和波长分配（RWA ）算法是 NP 难问题。

In this paper, hairpin structure and molecular beacons are applied in solving a few NP complete problems .

本文主要给出发夹结构及分子信标在几个 NP 完全问题中的应用。

Production scheduling problem has been shown to be a NP complete problem .

经证明，生产调度问题是 NP 完全问题。

First the problem was modeled as an instance of vertex cover problem which was an NP -Complete problem .

先把该问题归结为图的顶点覆盖问题，它是一个 NP 完全问题；

The candidate key of minimum cardinality problem was pointed out to be NP-complete in literature [1 ], [2], and [3].

文献 [1 ]、[2 ]、[3 ]均明确指出，求一个关系模式的最小基数候选关键字问题是一个 NP 完全问题。

Weapon-target assignment(WTA) problems are NP-complete , classical methods for them result in exponential computational complexities .

火力分配问题是典型的 NP 完全问题，传统的求解算法存在指数级的时间复杂度。

There exists a huge number of graph problem which is NP-complete, many seemed simple question is intact NP- complete .

图论中的困难问题更是不胜枚举，有许多看起来简单的问题却是 NP 完全的。

Packing problem is NP complete, this paper uses an immune genetic algorithm to solve it.

本文用一种免疫遗传算法来研究装箱问题的求解。

We present the Maximum Disjoint Sets for Maintaining Coverage and Connectivity (MDS-MCC) problem, and we prove it is NP-complete .

在这一章节中我们将介绍保证覆盖和连同的最大化不相交节点结合问题（MDS-MCC ），同时我们证明这个问题是 NP 完全的。

Minimum path set and flow allocation problem(MPSFAP) were NP complete problems.

最小路径集和流量分配问题（MPSFAP ）是 NP 完全问题。

This paper formulates the satellite imaging scheduling problem as a 0-1 integer programming model , which is NP complete .

建立了卫星成像调度问题的 0-1 整数规划模型，该问题具有 NP 完全特性。

Graph vertex coloring problem (GVCP) is a NP-complete problem having good application such as scheduling and timetabling.

本文对图与组合优化问题中的一个典型问题，即图的顶点着色问题进行了研究。

and they are known to be NP -complete for general graphs .

对一般图来说，两类子问题都是 NP-完全问题；

Facility layout of job shop problem is non-linear and NP-complete characteristic , and can not he solved well by conventional methods .

车间设备布局问题具有非线性、NP 难等特性，无法运用传统方法求得最优解。

This is analogous to the NP Complete problem .

这与 NP 完全问题是类似的。

NP-complete

NP-complete

哈密尔顿回路问题

最小哈密尔顿回路问题

非多项式完全问题

旅行商问题

热词推荐

大家在看