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.
用数学规划方法研究主动控制力（简称控制力）在被控结构上的最优位置，把它视为广义0-1规划问题，用隐枚举法求解；
The problem of induction by simple enumeration remains unsolved to this day.
单纯枚举归纳问题到今天依旧是悬案。
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整数规划的隐枚举法，求解网络的多中心问题，算法简单，容易实现。
应用推荐