1) Second Shortest Travel Time Path
次最小路径
2) minimal path
最小路径
1.
A complex systemis usually described by minimal paths or minimal cutsets.
描述系统结构通常是用最小路径或最小割集。
2.
In this paper,we discuss the problem about description and calculation of reliability based on minimal path and minimal cutset for the class of complex system.
本文讨论基于最小路径和最小割集的复杂系统可靠性的描述与计算问题。
3) the minmax path
最大权最小路径
1.
Key wrods:the minimum spanning tree; the minmax path; the minmax adjustment time; risk out of stoc
通过分析任意点对之间字典序下最大权最小路径和最小生成树之间的关系,给出了解决上述问题的有效算法。
4) the best route and the second route
最优及次优路径
5) Predication of shortest travel time path
最小路径预测
6) minimum cost path
最小费用路径
1.
The objective is to find the minimum cost path considering node-waiting cost in a network,in which,waiting is allowed at every node and the arc-traversing cost,node-waiting cost and arc-traversing time are all discrete functions of time.
基于动态规划原理,给出了一种标号更新算法,可在O(n3M3)时间复杂度内求出所有结点到指定终点的最小费用路径,其中n为网络结点数、M为时间间隔数。
补充资料：最小辐亮度与最小辐照度(见核爆炸火球)
最小辐亮度与最小辐照度(见核爆炸火球)
minimum-brightness and minimum-irradiance
zuixiao fuliangdu yu zuixiaofu乙haodu最小辐亮度与最小辐照度(minimum-brightness and而nimum一irradianee)见核爆炸火球。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条