A hybrid genetic algorithm for solving 0/1 Knapsack Problem.
Soukaina LaabadiMohamed NaimiHassan El AmriBoujemâa AchchabPublished in: LOPAL (2018)
Keyphrases
- knapsack problem
- optimal solution
- optimization problems
- combinatorial optimization problems
- test problems
- dynamic programming
- greedy algorithm
- np hard
- exact algorithms
- multidimensional knapsack problem
- bicriteria
- linear programming relaxation
- np hard problems
- continuous relaxation
- greedy heuristic
- cutting plane
- lp relaxation
- implicit enumeration