A surface-based DNA algorithm for the solving binary knapsack problem.
Majid DarehmirakiHasan Mishmast NehiPublished in: Appl. Math. Comput. (2007)
Keyphrases
- knapsack problem
- dynamic programming
- implicit enumeration
- np hard
- optimal solution
- test problems
- optimization problems
- optimization algorithm
- particle swarm optimization
- computational complexity
- combinatorial optimization problems
- np hard problems
- combinatorial optimization
- binary variables
- bicriteria
- objective function
- lower bound
- lp relaxation