On the Two-Dimensional Knapsack Problem for Convex Polygons.
Arturo I. MerinoAndreas WiesePublished in: ICALP (2020)
Keyphrases
- knapsack problem
- convex hull
- minkowski sum
- digital convexity
- combinatorial optimization problems
- optimal solution
- three dimensional
- optimization problems
- dynamic programming
- test problems
- exact algorithms
- np hard
- linear programming relaxation
- convex optimization
- greedy algorithm
- bicriteria
- np hard problems
- convex polyhedra
- heuristic solution
- multidimensional knapsack problem
- piecewise linear
- maximum profit
- objective function
- continuous relaxation
- greedy heuristic
- cutting plane
- convex sets
- implicit enumeration
- branch and bound