DNA solution of integer linear programming
作者：
Highlights：
•
摘要
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.
论文关键词：DNA computing,Integer linear programming
论文评审过程：Available online 16 February 2005.
论文官网地址：https://doi.org/10.1016/j.amc.2004.12.019
