Joint Performance of Greedy Heuristics for the Integer Knapsack Problem.
Rajeev KohliRamesh KrishnamurtiPublished in: Discret. Appl. Math. (1995)
Keyphrases
- knapsack problem
- greedy heuristics
- set cover
- greedy algorithm
- np hard
- optimal solution
- scheduling problem
- continuous relaxation
- greedy heuristic
- integer variables
- decision variables
- combinatorial optimization problems
- optimization problems
- dynamic programming
- linear programming relaxation
- multidimensional knapsack problem
- exact algorithms
- bicriteria
- objective function
- feasible solution
- neural network
- approximation algorithms
- linear programming
- lower bound
- multiple objectives
- solution space
- branch and bound