On the Two-Dimensional Knapsack Problem for Convex Polygons.
Arturo MerinoAndreas WiesePublished in: ACM Trans. Algorithms (2024)
Keyphrases
- knapsack problem
- minkowski sum
- convex hull
- digital convexity
- combinatorial optimization problems
- three dimensional
- optimal solution
- np hard
- dynamic programming
- optimization problems
- test problems
- multidimensional knapsack problem
- exact algorithms
- greedy algorithm
- linear programming relaxation
- np hard problems
- piecewise linear
- convex optimization
- convex polyhedra
- maximum profit
- heuristic solution
- decision variables
- bicriteria
- cell complexes
- continuous relaxation
- convex sets
- greedy heuristic
- implicit enumeration
- lower bound