DNA computation model to solve 0–1 programming problem

A Surface-Based DNA Algorithm for the 0-1 Programming Problem

“…(6)For the 3rd constraint inequality, add the DNA strands in the 3rd condition group to the surface and observe the high fluorescence intensity to analyze how many variables are hybridized on each strand. The strand 5 with 3 variables hybridized satisfies 3 =2, and the corresponding sets are: 3 1 , 0 , 1 s (see Figure.5). …”

“…In 2003, ZhixiangYin [2] solved the 01 programming problem with fluorescence labeling techniques based on surface. In 2004, FengyueZhang [3] proposed a new DNA computation model utilizing solution-based and surface-based methods to solve the 01 programming problem.…”

“…However, in papers [2] [3], they can only solve the 0-1 programming problem in which inequalities coefficients are 0 or 1. In this paper, a DNA encoding method to represent variables with arbitrary positive integer coefficients and a surface-based DNA algorithm are proposed to solve the 0-1 programming problem in which inequalities coefficients expand to arbitrary positive integer.…”

The Improvement on Algorithm of DNA Computing on 0-1 Planning Problem

“…Its preponderance is of high-parallel, variety, micromation, automatization. Yin Zhi-Xiang [4] ,Fengyue Zhang [5] succeeded in solving 0-1 planning problem by using DNA chip, which is the first example to solve programming by DNA computing.…”

“…In paper [4] and [5], we can find that the algorithm to solve 0-1 planning problem only can obtain the feasible solution set of 0-1 planning problem from all solution set by DNA computing at present but can not achieve the optimization solution of 0-1 planning problem from all solution set by DNA computing. However, in the worst case, the size of feasible solution set equal to the size of all solution set.…”