说明:双击或选中下面任意单词,将显示该词的音标、读音、翻译等;选中中文或多个词,将显示翻译。
您的位置:首页 -> 句库 -> 最小费用路径
1.
Time-dependent Minimum Cost Path Modal and Algorithm of Transport Network
时间相关的运输网络最小费用路径模型及算法
2.
The Analysis and Research on Shortest Path of Regional Road Network Based on Expenses;
基于费用的区域道路网最短路径分析研究
3.
The Model of Expense in Best Routing Distribution under Cross Influence
交叉口影响下的物流配送最优路径费用模型
4.
The Research and Application of Shortest Path Algorithm in Highway Networked Toll Collection
最短路径算法在高速公路联网收费中的研究及应用
5.
Research on the Inverse Dynamic Minimum Cost Path Problem under L_1 Norm;
动态最小费用路在L_1模下的逆问题研究
6.
Perfect State Description to the Solution of the Minimum Traffic Cost Problem;
求解最小交通费用路线问题完善的状态定义
7.
Finally, Chapter eleven covers the special topics of the maximal flow problem, the shortest path problem, and the multicommodity minimal cost flow problem.
最后,第十一章覆盖了特殊主题:最大化流问题、短路径问题和多物最小消费流问题。
8.
Research on Making of Railway Transport Price Using Theory of Minimum Cost Maximum Amount;
用最小费用最大流理论确定铁路货物运价问题的研究
9.
The Path Analysis of Optimal Consumption of China based on Consumer s Intertemporal Choice;
基于消费者跨期选择的中国最优消费路径分析
10.
Method of setting maximum speed limit based on minimum generalized running cost of vehicle
基于汽车行驶广义费用最小的高速公路最高车速限制方法
11.
Partial Least Square Path Modeling of the Customer Satisfaction Index Model Containing the Formative Model and It's Application
构成型顾客满意模型的偏最小二乘路径建模及其应用
12.
A Practical Algorithm for Finding the Shortest Kth Path Based on Deviation Path
基于背离路径的Kth最短路径实用搜索算法
13.
Lower and Upper Orientable Strong Radius and Diameter of Cartesian Product of Paths
路和路的笛卡尔积的最小和最大定向强半径和强直径(英文)
14.
The Research of Lowest Radius to High-Speed Railways with Ballastless Tracks;
无碴轨道高速铁路最小曲线半径研究
15.
On the Solution to Minimal Exposure Path Based on Dijkstra Algorithm
基于Dijkstra算法的最小暴露路径的求解
16.
PLS path modeling for pavement construction quality control
路面施工质量控制的偏最小二乘路径模型
17.
Searching optimal rush repair path of power lines based on improved max-min ant colony algorithm
基于改进的最大最小蚁群算法求解电力线路最佳抢修路径
18.
Research on Capacity Expansion with Minimum-cost and Maximum Network Flow
一类最小费用最大流的扩张问题研究