An enhanced binary slime mould algorithm for solving the 0-1 knapsack problem.
Abdollahzadeh BenyaminSaeid BarshandehHatef JavadiNicola EpicocoPublished in: Eng. Comput. (2022)
Keyphrases
- knapsack problem
- dynamic programming
- optimal solution
- test problems
- np hard
- implicit enumeration
- computational complexity
- learning algorithm
- combinatorial optimization problems
- search space
- worst case
- bicriteria
- simulated annealing
- optimization problems
- np hard problems
- constrained optimization
- greedy heuristic
- continuous relaxation
- cutting plane
- exact algorithms
- shortest path problem
- optimization algorithm
- particle swarm optimization
- cost function