1) successive shortest path algorithm
连续最短路算法
1.
In addition,based on the gain-flow network of the successive shortest path algorithm and these ristrictions,three optimization algorithms of the distribution of the minimum cost max-flow are put forward on the transportation network.
基于连续最短路算法中构造伴随增流网络的思路,设计了这3种约束限制条件下的最小费用最大流分配算法。
2) the shortest path algorithm
最短路算法
1.
A new heuristic algorithm based on tabu search and the shortest path algorithm is put forward to solve the uncapacitated multiple allocation p-hub median problem(UMApHMP).
针对无容量限制的多重分派枢纽中位问题(UMApHMP),提出了一种基于禁忌搜索和最短路算法的新的启发式算法。
3) shortest path algorithm
最短路算法
1.
Having abstracted the problem into a weighting network,which can describe special cases,this paper establishes a genetic algorithm according to shortest path algorithm in topology model and special constraint of constant node count.
提出了对物流配送网络在时间上的需求,将问题抽象为能够描述具体情景的加权网络,结合图论中最短路算法和问题中结点数目不变的约束条件设计了遗传算法,对问题作出了解答。
2.
An algorithmic format of the Djikstra shortest path algorithm is given.
给出了一种基于Djikstra最短路算法的实现,该算法实现可以求得有限权图中任一点到其他所有点的最短路径及相应的距离,并清晰完整地表现求解过程及所得结果。
3.
A new heuristic algorithm based on tabu search and shortest path algorithm is put forward to solve NSUMApHMP.
然后提出了一种基于禁忌搜索和最短路算法解决NSUMApHMP的新的启发式算法。
4) sequential short-circuit
连续短路
5) shortest path algorithm
最短路径算法
1.
Research on Shortest Path Algorithm Based on Graph in Dynamic Navigation System;
基于图论的动态导航系统最短路径算法研究
2.
This method gets the connection relationship by using the breadth first search algorithm,meanwhile puts forward the shortest path algorithm,which passes each vertex in the completed.
首先采用广度优先搜索算法得到原理图中元件端子的连接关系,同时提出了完全无向图中经过每个顶点一次且仅一次的最短路径算法和改进的Prim最小生成树算法,利用这两个算法可自动生成屏内安装接线图和端子接线图。
3.
Based on the thorough analysis of the network communication of the Network-on-Chip(NoC) and study of the shortest path algorithms, a directed Ford-Fulkerson algorithm is proposed in this paper.
文章通过对NoC网络通讯的分析,以及对现有最短路径算法的研究,提出了一种定向Ford-Fulker-son算法,实现了NoC路径分配;在完成处理单元映射后,根据NoC网络的通讯状况,按照通讯任务的时间顺序分配传输路径,使得任意处理单元间的通讯时间最短,且整个系统的执行时间最优。
6) the shortest path algorithm
最短路径算法
1.
Research of the the shortest path algorithm of urbanized public traffic networks;
城市公交网络的最短路径算法研究
补充资料：单相短路电流
分子式：
CAS号：
性质：一相导体与保护导体发生短路时流经相-零回路的电流。单相短路电流是评价和设计保护接零系统设计的基本要素。保护接零系统的单相短路电流不应小于低压断路器瞬时动作或短延时动作过电流脱扣器的整定电流的1.5倍；不应小于低压熔断器熔体额定电流的4倍。
CAS号：
性质：一相导体与保护导体发生短路时流经相-零回路的电流。单相短路电流是评价和设计保护接零系统设计的基本要素。保护接零系统的单相短路电流不应小于低压断路器瞬时动作或短延时动作过电流脱扣器的整定电流的1.5倍；不应小于低压熔断器熔体额定电流的4倍。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条