Name
Abstract | ||
|---|---|---|
In recent works for high performance computing, computation with DNA molecules, that is, DNA computing, has had considerable attention as one of non-silicon based computing. Using fea- tures of DNA molecules, we can solve some op- timization problems, which usually need exponential time on a silicon based computer, in a polynomial number of steps with DNA molecules. In this pa- per, we propose a procedure for computing the 0-1 integer programming which is a well-known - hard problem. An input of the problem consists of Boolean variables, linear constraints and an ob- jective function. Each coefficient or constant is de- noted by a binary number of bits. For the 0-1 integer programming, we propose a procedure which runs in steps using DNA strands. |
Year | Venue | Keywords |
|---|---|---|
2005 | FCS | dna computing,-hard problem,0-1 integer program- ming |
Field | DocType | Citations |
Polynomial,Supercomputer,Computer science,Branch and price,Branch and cut,Algorithm,Theoretical computer science,Integer programming,Boolean data type,Optimization problem,DNA computing | Conference | 0 |
PageRank | References | Authors |
0.34 | 9 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Akihiro Fujiwara | 1 | 122 | 27.25 |
| Kota Atsuyama | 2 | 0 | 0.34 |