A New Approach for Solving 0/1 Knapsack Problem.
Chou-Yuan LeeZne-Jung LeeShun-Feng SuPublished in: SMC (2006)
Keyphrases
- knapsack problem
- randomly generated test instances
- implicit enumeration
- combinatorial optimization problems
- dynamic programming
- linear relaxation
- optimization problems
- optimal solution
- test problems
- lp relaxation
- exact algorithms
- linear programming relaxation
- integer variables
- greedy algorithm
- multidimensional knapsack problem
- greedy heuristic
- np hard
- continuous relaxation
- np hard problems
- multiple objectives
- heuristic solution
- machine learning
- combinatorial optimization
- reinforcement learning
- evolutionary algorithm
- maximum profit
- genetic algorithm