The Semi-roboticized DNA Computing Model of the 0-1 Integer Programming Problem

To general 0-1 integer programming problem, we present a semi-roboticized DNA computing model. Firstly, all potential solutions of the given 0-1 integer programming problem are generated. Secondly, we set the probes corresponding to constraint inequalities of 0-1 integer programming problem, and use these probes to design semi-roboticized apparatus for separating all potential solutions automatically. Finally, we obtain the solutions of the 0-1 integer programming problem. The most merit of the model is its automation characteristic, and the model fits to solve arbitrary 0-1 integer programming problem having arbitrary variables