DNA Algorithm Based on Reverse Complement Alignment for 0/1 Knapsack Problem.
Yamin ZhengXiaowen LouPublished in: ICNC (6) (2009)
Keyphrases
- knapsack problem
- dynamic programming
- learning algorithm
- optimal solution
- np hard
- exact algorithms
- computational complexity
- cost function
- objective function
- test problems
- benchmark problems
- optimization algorithm
- greedy heuristic
- optimization problems
- worst case
- special case
- implicit enumeration
- shortest path problem
- integer programming
- particle swarm optimization
- linear programming