Faster approximation schemes for the two-dimensional knapsack problem.
Sandy HeydrichAndreas WiesePublished in: SODA (2017)
Keyphrases
- knapsack problem
- approximation schemes
- approximation algorithms
- np hard
- optimal solution
- combinatorial optimization problems
- dynamic programming
- optimization problems
- exact algorithms
- bicriteria
- multidimensional knapsack problem
- greedy heuristic
- continuous relaxation
- linear programming relaxation
- greedy algorithm
- bin packing
- decision variables
- evolutionary algorithm
- numerical methods
- maximum profit
- randomly generated test instances
- lower bound
- image segmentation
- branch and bound
- linear programming