Abstract
Previously, some DNA algorithms are used to solve the 0-1 programming problem which inequalities' coefficients are 0 or 1. In this paper, a DNA encoding method to represent variables with positive integer coefficients and a surface-based DNA algorithm are proposed to solve the 0-1 programming problem which inequalities' coefficients expand to arbitrary positive integers. The algorithm works in O(m) steps for 0-1 programming problem with m constraint inequalities and n variables.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
