Reoptimizing the 0-1 knapsack problem.
Claudia ArchettiLuca BertazziMaria Grazia SperanzaPublished in: Discret. Appl. Math. (2010)
Keyphrases
- knapsack problem
- optimal solution
- combinatorial optimization problems
- test problems
- optimization problems
- dynamic programming
- exact algorithms
- multidimensional knapsack problem
- np hard problems
- bicriteria
- multiple objectives
- linear programming relaxation
- cutting plane
- np hard
- heuristic solution
- production planning
- decision variables
- maximum profit
- vehicle routing problem
- greedy heuristic
- high dimensional
- greedy algorithm
- genetic algorithm
- simulated annealing
- scheduling problem
- evolutionary algorithm