A total-value greedy heuristic for the integer knapsack problem.
Rajeev KohliRamesh KrishnamurtiPublished in: Oper. Res. Lett. (1992)
Keyphrases
- greedy heuristic
- knapsack problem
- decision variables
- integer variables
- combinatorial optimization problems
- continuous relaxation
- optimal solution
- np hard
- dynamic programming
- greedy algorithm
- minimum weight
- optimization problems
- test problems
- exact algorithms
- multiple objectives
- linear programming relaxation
- worst case analysis
- multidimensional knapsack problem
- heuristic solution
- np hard problems
- bicriteria
- lower bound
- neural network
- maximum profit