A simulated annealing approach to the multiconstraint zero-one knapsack problem.
Andreas DrexlPublished in: Computing (1988)
Keyphrases
- knapsack problem
- simulated annealing
- optimization problems
- combinatorial optimization problems
- evolutionary algorithm
- tabu search
- multidimensional knapsack problem
- metaheuristic
- dynamic programming
- optimal solution
- test problems
- genetic algorithm
- combinatorial optimization
- np hard
- exact algorithms
- continuous relaxation
- solution quality
- np hard problems
- genetic algorithm ga
- linear programming relaxation
- bicriteria
- greedy algorithm
- multiple objectives
- cutting plane
- greedy heuristic
- heuristic solution
- traveling salesman problem
- implicit enumeration
- neural network
- particle swarm optimization pso
- lp relaxation
- objective function
- cost function
- maximum profit