We also present an algorithm based on implicit enumeration and simplex method on network.
在求解算法上，提出隐枚举法与网络单纯形法相结合的求解方法。
All variables were translated into binary variables, and implicit enumeration method was developed to solve the model.
把模型的变量转化为二进制变量，并用隐枚举法求出最优解。
According to probabilistic convergence of incomplete enumeration, the concept of near-implicit enumeration is proposed.
根据不完全枚举的概率收敛性，提出近隐式枚举的概念。
In this paper, the implicit enumeration methods for mathematical programming are effectively classified: well-implied and ill-implied enumerations.
对数学规划中的枚举法进行了有效的分类：良性隐式枚举与病态隐式枚举。
In this paper, the problem of multi-centres in a network is solved using implicit enumeration method for 0-1 integer programming. The algorithm is simple and can be easily realized.
本文提出用0 - 1整数规划的隐枚举法，求解网络的多中心问题，算法简单，容易实现。
The heuristic implicit enumeration presented in this thesis can effectively solve this kind of problems. It is different from other algorithms, such as simplex, cutting plane method, etc.
与其它算法（例单纯形法、割平面法）不同，本文提出的启发式隐枚举算法能很好的解决此类问题。
An illustration of the method shows that the solution quality by the HGA is better than that by Implicit Enumeration most in use.
算例证明，该算法的求解质量优于目前该领域常用的隐枚举算法。
An illustration of the method showed that the solution quality by the HGA is better than that by Implicit Enumeration most in use.
算例证明该算法的求解质量好于目前该领域常用的隐枚举算法。
An illustration of the method showed that the solution quality by the HGA is better than that by Implicit Enumeration most in use.
算例证明该算法的求解质量好于目前该领域常用的隐枚举算法。
应用推荐