A quasi-PTAS for the Two-Dimensional Geometric Knapsack Problem.
Anna AdamaszekAndreas WiesePublished in: SODA (2015)
Keyphrases
- knapsack problem
- combinatorial optimization problems
- dynamic programming
- approximation algorithms
- optimization problems
- optimal solution
- np hard
- exact algorithms
- three dimensional
- test problems
- multidimensional knapsack problem
- linear programming relaxation
- multiple objectives
- np hard problems
- greedy heuristic
- polynomial time approximation
- decision variables
- bicriteria
- heuristic solution
- continuous relaxation
- greedy algorithm
- implicit enumeration
- approximation schemes
- maximum profit
- search algorithm
- lower bound
- high dimensional
- cost function