首页 | 本学科首页   官方微博 | 高级检索  
     


Molecular solutions to the binary integer programming problem based on DNA computation
Authors:Yeh Chung-Wei  Chu Chih-Ping  Wu Kee-Rong
Affiliation:Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan 701, Taiwan, ROC.
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(nxk).
Keywords:DNA computing   Binary integer programming (BIP) problem   Integer linear programming
本文献已被 ScienceDirect PubMed 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号