0-1 programming problem的意思|示意
0-1规划问题
0-1 programming problem的网络常见释义
规划问题 0-1规划问题
0-1 programming problem相关短语
1、 the 0-1 programming problem 规划问题
2、 Solve the 0-1 programming problem 说明解决
3、 0-1 integer programming problem 整数规划问题
0-1 programming problem相关例句
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。
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反应即可读取问题的可行解。
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 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整数规划问题的求解。
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背包问题,从而可用动态规划寻求最佳的出清向量;
To general 0-1 Integer Programming problem problem, we present a semi-roboticized DNA computing model.
对一般的0 - 1整数规划问题提出了一种半自动化的DNA计算模型。