把模型的变量转化为二进制变量，并用隐枚举法求出最优解。
All variables were translated into binary variables, and implicit enumeration method was developed to solve the model.
在求解算法上，提出隐枚举法与网络单纯形法相结合的求解方法。
We also present an algorithm based on implicit enumeration and simplex method on network.
本文提出用0 - 1整数规划的隐枚举法，求解网络的多中心问题，算法简单，容易实现。
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规划问题，用隐枚举法求解；
A mathematical programming method is developed, by considerina the optimal placement of active control forces as a generalized0-1programming problem and solving it by implicit enumeration.
对数学规划中的枚举法进行了有效的分类：良性隐式枚举与病态隐式枚举。
In this paper, the implicit enumeration methods for mathematical programming are effectively classified: well-implied and ill-implied enumerations.
结合0 - 1整数规划的隐式枚举法对目标排序法进行分析。
Sort objective values to 0-1 integer programming based on implicit enumerations is firstly analyzed.
与其它算法（例单纯形法、割平面法）不同，本文提出的启发式隐枚举算法能很好的解决此类问题。
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.
与其它算法（例单纯形法、割平面法）不同，本文提出的启发式隐枚举算法能很好的解决此类问题。
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.
应用推荐