Hardness of Approximation for Knapsack Problems.
Harry BuhrmanBruno LoffLeen TorenvlietPublished in: Theory Comput. Syst. (2015)
Keyphrases
- knapsack problem
- np hard
- linear programming relaxation
- approximation algorithms
- combinatorial optimization problems
- exact algorithms
- optimal solution
- optimization problems
- test problems
- dynamic programming
- np complete
- error bounds
- production planning
- greedy algorithm
- continuous relaxation
- phase transition
- maximum profit
- feasible solution
- worst case
- computational complexity
- information theoretic
- upper bound
- cutting plane
- scheduling problem
- binary variables
- special case