The 0-1 programming problem is an important problem in opsearch and has very widespread application.
而0 1规划问题作为运筹学中一个重要的问题，到目前为止还没有好的算法。
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规划问题提出了一种运用赋权偶图及完美对集的求解方法。
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反应即可读取问题的可行解。
应用推荐