Title of article
Molecular solutions to the binary integer programming problem based on DNA computation
Author/Authors
Chung-Wei Yeh، نويسنده , , Chih-Ping Chu، نويسنده , , Kee-Rong Wu، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2006
Pages
11
From page
56
To page
66
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).
Keywords
Binary integer programming (BIP) problem , Integer linear programming , DNA computing
Journal title
BioSystems
Serial Year
2006
Journal title
BioSystems
Record number
497683
Link To Document