Solving 0-1 knapsack problem by binary flower pollination algorithm.
Mohamed Abdel-BassetDoaa El-ShahatIbrahim M. El-HenawyPublished in: Neural Comput. Appl. (2019)
Keyphrases
- knapsack problem
- dynamic programming
- optimal solution
- implicit enumeration
- learning algorithm
- test problems
- cost function
- combinatorial optimization problems
- multidimensional knapsack problem
- greedy algorithm
- machine learning
- computational complexity
- greedy heuristic
- bicriteria
- combinatorial optimization
- np hard problems
- optimization algorithm
- higher dimensional
- exact algorithms
- linear programming relaxation
- worst case
- neural network