1) method of setting minimum path
最短路布设法
2) the shortest path model
最短路法
3) 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),提出了一种基于禁忌搜索和最短路算法的新的启发式算法。
4) 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的新的启发式算法。
5) shortest path method
最短路径法
1.
Methods\ The shortest path method is used.
结果 给出了用最短路径法解决席位公平分配的具体步骤 。
2.
Then,the source signals can be recovered by the shortest path method.
在估计出混合矩阵的基础上,利用最短路径法分离出源信号。
6) maximum flow of minimum distance method
最短路-最大流法
补充资料：布设
1.布置。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条