An Experimental Study of Random Knapsack Problems.
René BeierBerthold VöckingPublished in: Algorithmica (2006)
Keyphrases
- knapsack problem
- combinatorial optimization problems
- optimal solution
- test problems
- dynamic programming
- np hard
- exact algorithms
- optimization problems
- linear programming relaxation
- production planning
- maximum profit
- bicriteria
- greedy algorithm
- upper bound
- worst case
- search space
- machine learning
- continuous relaxation