Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem.
Federico Della CroceAndrea GrossoPublished in: Comput. Oper. Res. (2012)
Keyphrases
- knapsack problem
- multi dimensional
- exact algorithms
- greedy heuristic
- heuristic solution
- randomly generated test instances
- combinatorial optimization problems
- optimal solution
- optimization problems
- np hard
- bicriteria
- test problems
- linear programming relaxation
- greedy algorithm
- dynamic programming
- greedy algorithms
- multidimensional knapsack problem
- np hard problems
- implicit enumeration
- continuous relaxation
- metaheuristic
- heuristic methods
- lower bound
- learning algorithm