查询词典 Np

Given a graph G representing a network topology, and a collection T ={(s1 , t1 )...} of pairs of vertices in G representing connection request, the maximum edge-disjoint paths problem is an NP-hard problem that consists in determining the maximum number of pairs in

给出图表G代表网络拓扑结构的和收藏品T ={(s1， t1)…}对端点在代表连接请求的G，最大值边缘弄乱问题是一个NP坚硬问题在确定包括对的最大数字的道路

Given a graph G representing a network topology, and a collection T ={(s1 , t1 )...} of pairs of vertices in G representing connection request, the maximum edge-disjoint paths problem is an NP-hard problem that consists in determining the maximum number of pairs inT that can be routed in G by mutually edge-disjoint si ti paths.

由于图G代表的网络拓扑，并且收藏笔=( S1及T1期……的顶点G大代表连接请求，最大边不相交的路径问题是一个NP-hard问题，它包括确定最多偶笔可以改为G大相互边相交硅钛路径。

Determining whether a formula in this form is satisfiable is still NP-complete, even if each clause is limited to at most three literals.

确定是否一个公式以这种形式是符合要求仍然是NP完全问题，即使是有限的每一条款上最多三个文字。

Consequently, it is meaningful to systematically get optimal solving of LRP models. Contribution of the research is the innovation in big scale mathematical calculation of NP-hard problem and it is also the academic foundation of developed city logistics distribution systems on account of electronic commerce. The research has extraordinary significance to developed self-action logistics distribution software in large amount of electronic commerce dealings.

因此对LRP模型进行系统化优化求解研究具有重要的理论价值，其理论意义则在于针对NP-hard模型大规模数值计算的解法突破和创新，同时也是发展基于电子商务的城市物流配送理论的重要理论基础，这将为日后面对巨大交易量的电子商务环境下开发自动物流配送调度系统软件具有非常重要的现实意义。

Although the disperse model is beautiful and sententiously, the problem is NP-hard problem, when the number of aminophenol is very huge, the style of the difficulty of settle the problem is exponential, solving the problem is impossible.

离散模型固然很简洁优美，但是蛋白质结构的预测问题是NP-HARD问题，当蛋白质一维氨基酸序列的链长n很大的时候，计算时间随着问题规模的增加呈指数方式增长，求解将变得非常困难。

Slab sequencing problem is a kind of special sequenceing problem with complex constraints and NP-hard character.

热轧调度中的板坯排序问题是一类特殊的排序问题，具有约束条件复杂、NP难特点。

Mixed model assembly flow line is a kind of multiple products and low volume production organization method, through that the enterprise realized to response quickly to market needs. Line balancing and Model sequencing are both NP-hard problem and they are tightly interrelated and influenced each other in mixed model assembly flow line.

混合装配流水线是实现快速响应的一种多品种小批量的生产组织方式，流水线平衡和产品排序是紧密相关而且对目标值存在交互影响作用的两个NP-hard问题。

It is known that a production sequencing problem in mixed-model assembly line falls into NP-hard class of combinatorial optimization problem and thus a large-sized problem may be computationally intractable.

本文应用一种解大规模组合优化问题，特别是NP完全组合优化问题的有效近似算法——模拟退火算法，来求解混流生产线的投产排序问题，克服了上述缺点。

The shortest path problem is a basic problem in network design,which is NP-complete.

最短路问题是一个经典的NP-完全问题，在网络设计里有着重要的作用。

The vessel stowage planning is not only a complex combination and optimization problem, but also a NP-Complete problem.

大型集装箱船舶配载问题是一个复杂的组合优化问题，而且是一个NP问题。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。