Genetic Algorithms for the 0/1 Knapsack Problem.
Zbigniew MichalewiczJaroslaw ArabasPublished in: ISMIS (1994)
Keyphrases
- knapsack problem
- genetic algorithm
- multidimensional knapsack problem
- search heuristics
- combinatorial optimization problems
- optimal solution
- optimization problems
- exact algorithms
- neural network
- np hard
- test problems
- dynamic programming
- metaheuristic
- linear programming relaxation
- evolutionary algorithm
- bicriteria
- np hard problems
- multi objective
- artificial neural networks
- greedy algorithm
- heuristic solution
- differential evolution
- fitness function
- simulated annealing
- implicit enumeration
- particle swarm optimization pso
- greedy heuristic
- genetic programming
- continuous relaxation
- vehicle routing problem
- sensitivity analysis
- linear program
- evolutionary computation
- decision variables
- tabu search
- upper bound
- special case