Greedy algorithms for a class of knapsack problems with binary weights.
Jochen GorskiLuís PaqueteFábio PedrosaPublished in: Comput. Oper. Res. (2012)
Keyphrases
- greedy algorithms
- knapsack problem
- greedy algorithm
- binary variables
- combinatorial optimization problems
- optimal solution
- test problems
- optimization problems
- dynamic programming
- bicriteria
- continuous relaxation
- np hard
- production planning
- search algorithm
- exact algorithms
- np hard problems
- linear combination
- genetic algorithm
- linear functions
- machine learning