On the Two-Dimensional Knapsack Problem for Convex Polygons.
Arturo I. MerinoAndreas WiesePublished in: CoRR (2020)
Keyphrases
- knapsack problem
- minkowski sum
- convex hull
- digital convexity
- combinatorial optimization problems
- three dimensional
- test problems
- optimal solution
- optimization problems
- dynamic programming
- exact algorithms
- cutting plane
- convex polyhedra
- np hard
- convex optimization
- multidimensional knapsack problem
- linear programming relaxation
- greedy heuristic
- bicriteria
- heuristic solution
- piecewise linear
- greedy algorithm
- np hard problems
- convex sets
- decision variables
- evolutionary algorithm
- maximum profit
- cell complexes