.png){kind=icon}
Return
DNA solution of integer linear programming
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2004.12.019.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (c) 2005 Elsevier Inc. All rights reserved.
Keywords:
DNA computing
integer linear programming
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSavePerformance and limits of feedback cooling methods for levitated oscillators: A direct comparison
OAAI
OAAIShareSaveShareSave no more
no more