1) cheapest insertion method
增量最小插入法
1.
In addition, we prove the performance ratios of the convex hull cheapest insertion method, convex hull nearest insertion method and convex hull nearest addition method for the Euclidean traveling salesman problem have the upper bound 3.
另外,对凸包增量最小插入法、凸包最近插入法及凸包最近加入法给出了性能比不超过3的证明。
2) least input increment
最小输入增量
3) the least increment
最小增量
1.
the least increment method.
针对石油天然气勘探、开发、炼制、储运、销售上下游一体化的现代纵向企业内部存在的任务分派、成本核算及效益最大化问题,提出了一种求分派问题最优解的新方法——最小增量法。
4) nearest insertion heuristic
最近插入法
1.
After obtained the original results with "nearest insertion heuristic" algorithm,a hybrid solution which combined "genetic algorithm" and "simulated annealing" was designed to improve the results.
先采用最近插入法生成初始解,然后基于遗传算法和模拟退火算法改进初始解。
5) the nearest insertion method
最邻近插入法
1.
With the nearest insertion method and branch-and-bound method,a graphic model and corresponding algorithm for optimal tourist route selection is offered.
运用"最邻近插入法"和"分枝定界法"两种方法建立寻找近似最佳旅游线路的图论模型,提出求解的算法,并以莆田市为例具体分析它们的求解过程,为旅游者设计旅游线路提供理论依据和参考。
6) min-cost max-flow augmentation algorithm
最小费用最大流增量算法
1.
The network flow sub-graph needed to adjust is extracted from the previous network flow graph and the min-cost max-flow augmentation algorithm is run on it.
首先对给定的数据流图进行单电压高层次综合,然后对单电压综合结果迭代地进行多电压调整;提取每次迭代时需要调整的网络流子图,对该子图运行最小费用最大流增量算法。
补充资料：最小辐亮度与最小辐照度(见核爆炸火球)
最小辐亮度与最小辐照度(见核爆炸火球)
minimum-brightness and minimum-irradiance
zuixiao fuliangdu yu zuixiaofu乙haodu最小辐亮度与最小辐照度(minimum-brightness and而nimum一irradianee)见核爆炸火球。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条