A Class of Generalized Greedy Algorithms for the Multi-Knapsack Problem.
A. H. G. Rinnooy KanLeen StougieCarlo VercellisPublished in: Discret. Appl. Math. (1993)
Keyphrases
- knapsack problem
- greedy algorithms
- greedy algorithm
- combinatorial optimization problems
- optimal solution
- optimization problems
- dynamic programming
- np hard
- exact algorithms
- test problems
- multidimensional knapsack problem
- heuristic solution
- np hard problems
- multiple objectives
- decision variables
- continuous relaxation
- objective function
- linear programming relaxation
- implicit enumeration
- cutting plane
- greedy heuristic
- bicriteria
- evolutionary algorithm