Average performance of greedy heuristics for the integer knapsack problem.
Rajeev KohliRamesh KrishnamurtiPrakash MirchandaniPublished in: Eur. J. Oper. Res. (2004)
Keyphrases
- knapsack problem
- greedy heuristics
- set cover
- integer variables
- np hard
- continuous relaxation
- scheduling problem
- greedy algorithm
- decision variables
- greedy heuristic
- combinatorial optimization problems
- optimal solution
- dynamic programming
- optimization problems
- multidimensional knapsack problem
- exact algorithms
- bicriteria
- linear programming relaxation
- maximum profit
- objective function
- approximation algorithms
- linear programming
- evolutionary algorithm
- lower bound
- computational complexity