Population Decomposition-Based Greedy Approach Algorithm for the Multi-Objective Knapsack Problems.
Jiawei YuanHai-Lin LiuChaoda PengPublished in: Int. J. Pattern Recognit. Artif. Intell. (2017)
Keyphrases
- knapsack problem
- multi objective
- optimization algorithm
- dynamic programming
- greedy algorithms
- greedy algorithm
- greedy heuristic
- optimal solution
- learning algorithm
- computational complexity
- evolutionary algorithm
- np hard
- computational efficiency
- optimization problems
- decomposition algorithm
- test problems
- convex hull
- particle swarm optimization
- linear programming
- search space
- objective function
- multi objective optimization problems
- multi objective evolutionary algorithms
- shortest path problem
- network flow
- combinatorial optimization problems
- convergence rate
- worst case
- reinforcement learning