1) the standard tansportation network
![点击朗读](/dictall/images/read.gif)
典则型运输网络
2) the standard transportation network
![点击朗读](/dictall/images/read.gif)
正则型运输网络
3) regular beam transport network
![点击朗读](/dictall/images/read.gif)
规则的束流输运网络
4) transport network
![点击朗读](/dictall/images/read.gif)
运输网络
1.
Vehicular transport network optimization model based on relational matrices searching for routes;
基于关系阵搜寻路线的车辆运输网络优化模型
2.
Application of Dijkstra algorithm in enterprise s logistic transport network;
![点击朗读](/dictall/images/read.gif)
Dijkstra算法在企业物流运输网络中的应用
3.
Time-dependent Minimum Cost Path Modal and Algorithm of Transport Network
![点击朗读](/dictall/images/read.gif)
时间相关的运输网络最小费用路径模型及算法
5) transportation network
![点击朗读](/dictall/images/read.gif)
运输网络
1.
The Study of the Shortest Paths in Transportation Network Under Time Constraint;
![点击朗读](/dictall/images/read.gif)
时间约束下的运输网络最短路径研究
2.
Study on transportation network optimization about transportation decision-making for logistic delivery;
物流配送决策中的运输网络优化问题研究
3.
Petri net simulation algorithm of maximum flow in transportation network;
![点击朗读](/dictall/images/read.gif)
运输网络最大流的Petri网图仿真算法
6) the transportation network
![点击朗读](/dictall/images/read.gif)
运输网络
1.
An algorithm with polynomial complexity O(n 3) is produced in this article,for seeking the maximum capacity paths between arbitrary two nodes in the transportation network.
给出了一个求运输网络中任意两顶点间最大容量路的多项式算法X2,证明了算法的正确性,分析了算法的复杂性为O(n3)。
2.
Authors produce an algorithm for seeking the maximum Capacity Paths from the specified node to all other nodes in the transportation network,which has polynomial complexity O(n 2).
给出了一个求运输网络从固定顶点到所有其他顶点的多项式算法x1,证明了该算法的正确性,分析了它的复杂性为O(n2)。
补充资料:典则
1.典章法则;准则。 2.特指诗文等的法则﹑章法。
说明:补充资料仅用于学习参考,请勿用于其它任何用途。
参考词条