| Article ID: | iaor2007946 |
| Country: | Netherlands |
| Volume: | 170 |
| Issue: | 1 |
| Start Page Number: | 626 |
| End Page Number: | 732 |
| Publication Date: | Nov 2005 |
| Journal: | Applied Mathematics and Computation |
| Authors: | Wang Shiying, Yang Aiming |
The integer linear programming is an NP-complete problem. In this paper, a detailed discussion is given of DNA algorithms for the DNA solution of the integer linear programming.