An elite opposition-flower pollination algorithm for a 0-1 knapsack problem.
Mohamed Abdel-BassetYongquan ZhouPublished in: Int. J. Bio Inspired Comput. (2018)
Keyphrases
- knapsack problem
- dynamic programming
- np hard
- optimal solution
- objective function
- combinatorial optimization problems
- test problems
- implicit enumeration
- computational complexity
- k means
- cost function
- learning algorithm
- optimization algorithm
- linear programming
- neural network
- particle swarm optimization
- optimization problems
- simulated annealing
- integer programming
- scheduling problem
- multi objective
- lower and upper bounds
- np hard problems