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 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 model belongs to mixed 0-1 integer programming model and is NP problem, the more difficult to solve directly.
该模型为混合0 - 1整数规划模型，属于NP问题，直接求解较困难。
The model belongs to mixed 0-1 integer programming model and is NP problem, the more difficult to solve directly.
该模型为混合0 - 1整数规划模型，属于NP问题，直接求解较困难。
应用推荐