A Hybrid Genetic Algorithm to Solve Zero-One Knapsack Problem.
Qing ChenYuxiang ShaoPublished in: ICAIC (1) (2011)
Keyphrases
- knapsack problem
- genetic algorithm to solve
- combinatorial optimization problems
- optimal solution
- genetic algorithm
- exact algorithms
- optimization problems
- dynamic programming
- np hard
- test problems
- linear programming relaxation
- greedy algorithm
- greedy heuristic
- multidimensional knapsack problem
- np hard problems
- heuristic solution
- bicriteria
- evolutionary algorithm
- continuous relaxation
- maximum profit
- cutting plane
- implicit enumeration
- lp relaxation
- multiple objectives
- vehicle routing problem
- special case
- search space
- bayesian networks