Solving the set-union knapsack problem by a novel hybrid Jaya algorithm.
Congcong WuYichao HePublished in: Soft Comput. (2020)
Keyphrases
- knapsack problem
- optimal solution
- dynamic programming
- implicit enumeration
- learning algorithm
- cost function
- np hard
- combinatorial optimization
- convex hull
- exact algorithms
- computational complexity
- test problems
- particle swarm optimization
- objective function
- worst case
- search space
- phase transition
- combinatorial optimization problems
- linear programming relaxation
- greedy heuristic
- minimum length