| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 2077004 | Biosystems | 2006 | 11 Pages |
Abstract
Binary optimization is a widely investigated topic in integer linear programming. This study proposes a DNA-based computing algorithm for solving the significantly large binary integer programming (BIP) problem. The proposed approach is based upon Adleman and Lipton's DNA operations to solve the BIP problem. The potential of DNA computation for the BIP problem is promising given the operational time complexity of O(n × k).
Related Topics
Physical Sciences and Engineering
Mathematics
Modelling and Simulation
Authors
Chung-Wei Yeh, Chih-Ping Chu, Kee-Rong Wu,