助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   约束最短路 的翻译结果: 查询用时:0.008秒
图标索引 在分类学科中查询
所有学科
数学
更多类别查询

图标索引 历史查询
 

约束最短路
相关语句
  restricted shortest path
     It is a kind of generalization of the famous restricted shortest path problem for one pair of points and then the complexity of this problem is NP-C.
     当点对数为 1时即为约束最短路问题 ,因此这是一个NP -C问题。
短句来源
     We construct an new 2 dimension networks based on the given networks, using the algorithm of restricted shortest path problem, we then give a polynomial time approximation scheme for this problem with two pair of points.
     本文设法在原有网络基础上构造出一个新的 2维网络 ,然后利用约束最短路问题的算法给出一个点对数为 2时的多项式时间近似方案 (PTAS)。
短句来源
  “约束最短路”译为未确定词的双语例句
     Heuristic Algorithm for Shortest Path Problem with Nonlinear Constraints
     非线性约束最短路问题的启发式算法(英文)
短句来源
     Approximation Scheme for a Kind of Shortest Path Problem with Two Additional Constraints
     一类双约束最短路问题的近似算法
短句来源
     Simulated Annealing Approach for a Kind of Shortest Path Problem with Multi-additional Constraints
     一类多约束最短路问题的模拟退火算法
短句来源
     The shortest path problem with two additional constraints in transition time and number of edges is NP Complete.
     带时间和边数约束的双约束最短路问题是NP 完备的 .
短句来源
     The shortest path problem with multi-additional constraints in arcs is NP-Complete. A simulated annealing approach for this problem is proposed, and the actual computational results of examples show that the SA algorithm is feasible and efficient.
     讨论了一类NP-C问题——多弧权约束最短路问题通过对搜索操作和参数的合理设置提出求解多约束最短路问题的模拟退火算法,并 通过对实例的计算表明该算法能快速有效地求出多约束最短路问题的最优解.
短句来源
  相似匹配句对
     The Algorithm of the Network Shortest Route Restrained by Parameter-e
     带有e约束的网络短路算法
短句来源
     SHORTEST PATH PROBLEM WITH CONSTRAINTS OF NODE'S COST
     点带约束成本的短路问题
短句来源
     Heuristic Algorithm for Shortest Path Problem with Nonlinear Constraints
     非线性约束短路问题的启发式算法(英文)
短句来源
     Approximation Scheme for a Kind of Shortest Path Problem with Two Additional Constraints
     一类双约束短路问题的近似算法
短句来源
     Shortest path problem with constraints of node's and edge's cost and its algorithm
     点、边带约束成本的短路问题及其算法
短句来源
查询“约束最短路”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  restricted shortest path
In particular, we propose a novel blend of generic service curves as abstraction of network transport services, of the associated network calculus under min-plus algebra and of existing heuristics for the restricted shortest path problem.
      


In this paper,we put forward the shortest path problem with constraints of nodes and arcs cost,then prove that this problme belongs to NP C and a pseudopolynomial time algorithm is given for this problem.Lastly a polynomial time algorithm is given for the min cost shortest path problem

本文首先提出了带点弧约束的最短路问题,证明了该问题属于NP-C,然后给出了一个伪多项式时间算法.最后给出了最小成本最短路问题的一个时间复杂性为O(n2)的算法.

In this paper, we present a weight constrained point-to-point connection problem in directed networks. It is a kind of generalization of the famous restricted shortest path problem for one pair of points and then the complexity of this problem is NP-C. We construct an new 2 dimension networks based on the given networks, using the algorithm of restricted shortest path problem, we then give a polynomial time approximation scheme for this problem with two pair of points.

本文首先提出一个有向网络中点对间加权约束的最小费用连接问题。当点对数为 1时即为约束最短路问题 ,因此这是一个NP -C问题。本文设法在原有网络基础上构造出一个新的 2维网络 ,然后利用约束最短路问题的算法给出一个点对数为 2时的多项式时间近似方案 (PTAS)。

The shortest path problem with two additional constraints in transition time and number of edges is NP Complete.A pseudo-polynomial exact algorithm for it is presented by using dynamic programming method.On the basis of this,a fully polynomial approximation scheme(EPAS)is provided through the techniques of rounding and scaling.

带时间和边数约束的双约束最短路问题是NP 完备的 .它的一种拟多项式精确算法可以利用动态规划方法给出 ,在此基础上采用rounding和scaling的处理技术得到了一种全多项式时间近似方案 (FPAS) .

 
<< 更多相关文摘    
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关约束最短路的内容
在知识搜索中查有关约束最短路的内容
在数字搜索中查有关约束最短路的内容
在概念知识元中查有关约束最短路的内容
在学术趋势中查有关约束最短路的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社