Solving the 0/1 knapsack problem using an adaptive genetic algorithm.
Zoheir EzzianePublished in: Artif. Intell. Eng. Des. Anal. Manuf. (2002)
Keyphrases
- knapsack problem
- genetic algorithm
- randomly generated test instances
- multidimensional knapsack problem
- implicit enumeration
- combinatorial optimization problems
- optimization problems
- linear relaxation
- dynamic programming
- optimal solution
- combinatorial optimization
- lp relaxation
- metaheuristic
- test problems
- multiple objectives
- linear programming relaxation
- exact algorithms
- greedy algorithm
- np hard
- multi objective
- neural network
- evolutionary algorithm
- integer variables
- linear programming problems
- bicriteria
- maximum profit
- greedy heuristic
- exact solution
- fitness function
- simulated annealing
- cutting plane