) volume molecular solution for the 0-1 knapsack problem on DNA-based supercomputing.
Yong JiangKenli LiZhishui ZhongGoodman MakojoaPublished in: BIC-TA (2010)
Keyphrases
- knapsack problem
- implicit enumeration
- dna computing
- optimal solution
- greedy heuristic
- decision variables
- optimization problems
- heuristic solution
- linear programming relaxation
- dynamic programming
- combinatorial optimization problems
- cutting plane
- np hard
- multidimensional knapsack problem
- dna sequences
- exact algorithms
- greedy algorithm
- linear programming
- solution quality
- lp relaxation
- evolutionary algorithm
- linear relaxation
- objective function
- integer programming
- special case
- sequence analysis
- scheduling problem