Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9506557 | Applied Mathematics and Computation | 2005 | 7 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Shiying Wang, Aiming Yang,