Binary Fireworks Algorithm for 0-1 Knapsack Problem.
Junjie XueJiyang XiaoJie ZhuPublished in: AIAM (IEEE) (2019)
Keyphrases
- knapsack problem
- dynamic programming
- optimal solution
- np hard
- objective function
- greedy heuristic
- exact algorithms
- test problems
- computational complexity
- search space
- learning algorithm
- worst case
- bicriteria
- optimization algorithm
- np hard problems
- combinatorial optimization problems
- solution quality
- simulated annealing
- cost function
- greedy algorithm
- linear programming