Solving 0-1 knapsack problems based on amoeboid organism algorithm.
Xiaoge ZhangShiyan HuangYong HuYajuan ZhangSankaran MahadevanYong DengPublished in: Appl. Math. Comput. (2013)
Keyphrases
- knapsack problem
- learning algorithm
- optimal solution
- dynamic programming
- worst case
- k means
- implicit enumeration
- cost function
- test problems
- optimization algorithm
- convergence rate
- computational complexity
- search space
- np hard
- objective function
- solution quality
- expectation maximization
- combinatorial optimization
- computational efficiency
- detection algorithm
- particle swarm optimization
- combinatorial optimization problems
- special case