A procedure-based heuristic for 0-1 Multiple Knapsack Problems.
Mohamed Esseghir LalamiMoussa ElkihelDidier El BazVincent BoyerPublished in: Int. J. Math. Oper. Res. (2012)
Keyphrases
- knapsack problem
- exact algorithms
- multidimensional knapsack problem
- optimal solution
- linear programming relaxation
- heuristic solution
- dynamic programming
- optimization problems
- combinatorial optimization problems
- search algorithm
- greedy heuristic
- randomly generated test instances
- simulated annealing
- test problems
- cutting plane
- mixed integer program
- production planning
- special case
- genetic algorithm
- neural network