To general 0-1 Integer Programming problem problem, we present a semi-roboticized DNA computing model.
对一般的0 - 1整数规划问题提出了一种半自动化的DNA计算模型。
The most merit of the model is its automatization characteristic, and the model fits to solve arbitrary 0-1 Integer Programming problem having arbitrary variable element.
同时,从理论上来讲,该模型适合含有任意变量的任意0-1整数规划问题的求解。
A model for optimizing fault diagnosis for power systems is formulated as a 0-1 integer programming problem. The fault equipment can be determined by means of refined mathematical manipulation.
电网故障诊断优化模型可将诊断问题表示成求极值的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整数规划的隐枚举法,求解网络的多中心问题,算法简单,容易实现。
The model belongs to mixed 0-1 integer programming model and is NP problem, the more difficult to solve directly.
该模型为混合0 - 1整数规划模型,属于NP问题,直接求解较困难。
Expressing decision variables of the structure optimization problem in the form of vector, a 0-1 integer nonlinear programming model is presented.
该结构优化问题的决策变量采用了向量表示方法,建立0-1整数非线性规划模型,给出了可行解存在性的判定方法。
The FADM algorithm transforms the traditional multiple goods auction into an integer 0/1 knapsack problem, whereby the optimal clearing vector can be found with dynamic programming.
FADM算法将传统的多物品拍卖问题转化为整数型0/1背包问题,从而可用动态规划寻求最佳的出清向量;
The FADM algorithm transforms the traditional multiple goods auction into an integer 0/1 knapsack problem, whereby the optimal clearing vector can be found with dynamic programming.
FADM算法将传统的多物品拍卖问题转化为整数型0/1背包问题,从而可用动态规划寻求最佳的出清向量;
应用推荐