Linear programming: methods and applications (5th ed.)
Linear programming: methods and applications (5th ed.)
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Graph Theory With Applications
Graph Theory With Applications
Hi-index | 0.00 |
DNA computing is a novel method of solving a class of intractable computational problem, in which the computing speeds up exponentially with problem size. Up to now, many accomplishments have been made to improve its performance and increase its reliability. The positive integer linear programming is an NP-complete problem, in the paper, we solved the positive integer linear programming problem with fluorescence labeling techniques based on surface chemistry by attempted to apply DNA computing to programming problem. Our method has some significant advantages such as simple encoding, low cost, and short operating time.