The weigh evaluation function is used to solve this model, and then a Multipath Flow Allocating Routing (MFAR) algorithm is proposed based on it.
利用权衡评价函数实现了模型的求解，进而提出一种多径流量分配路由（MFAR）算法。
After demonstrating the feasibility of using the dual algorithm for general linear programming to solve this model, we get an effective algorithm.
通过论证用一般线性规划的对偶算法求解本模型的可行性，使得该模型的求解问题迎刃而解。
Combing the theory of interval minimum load cutting problem, the improved greedy randomized adaptive search procedure (GRASP) is used to solve this model.
结合区间最小切负荷的相关理论，使用改进的贪婪随机自适应搜索算法可快速有效的求解该模型。
应用推荐