This formulation results in a large scale 0-1 programming problem with nonlinear objective function and linear or nonlinear constraints.
该数学表达式表现为一个具有非线性目标函数及线性与非线性约束条件的大规模0 - 1规划问题。
By using this method a DNA algorithm to solve 0-1 programming problem is proposed and PCR is done only 4 times of to detect the feasible solutions.
基于该编码方法所建立的DNA计算模型可用于求解0-1规划问题，只需4次PCR反应即可读取问题的可行解。
The processing task assignment is formulated as a quadratic 0-1 programming problem, and a distributed OALL algorithm (optimizing assignment layer by layer) is proposed.
针对处理任务分配，将其建模为二次0 - 1规划问题，并提出了分布式逐层优化分配算法oall。
This article gives a solution to the programming 0-1 problem whose objective function is a nonlinear function, by applying weighted bipartite graph and perfect matching.
本文对一种目标函数为非线性函数的0—1规划问题提出了一种运用赋权偶图及完美对集的求解方法。
To general 0-1 Integer Programming problem problem, we present a semi-roboticized DNA computing model.
对一般的0 - 1整数规划问题提出了一种半自动化的DNA计算模型。
This paper presents a neighborhood search algorithm for finding a local minimal solution of the problem, then a filled function method for solving 0-1 programming is proposed.
文章首先给出搜索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 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 0-1 programming model for the optimal lineup problem of group competition of woman physical jerks is established, and the method for finding its optimal solutions is explored.
建立女子体操团体赛最佳阵容问题的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问题，直接求解较困难。
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整数规划问题，从而可通过严密的数学运算来确知故障设备。
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背包问题，从而可用动态规划寻求最佳的出清向量；
应用推荐