The Product Knapsack Problem: Approximation and Complexity.
Ulrich PferschyJoachim SchauerClemens ThielenPublished in: CoRR (2019)
Keyphrases
- knapsack problem
- production planning
- combinatorial optimization problems
- linear programming relaxation
- optimal solution
- optimization problems
- approximation error
- exact algorithms
- dynamic programming
- np hard problems
- test problems
- np hard
- multidimensional knapsack problem
- heuristic solution
- computational complexity
- greedy algorithm
- continuous relaxation
- cutting plane
- bicriteria
- worst case
- implicit enumeration
- np complete
- maximum profit
- approximation algorithms
- error tolerance
- lower bound
- scheduling problem
- greedy heuristic
- random variables
- decision variables
- ant colony optimization
- mixed integer programming