Approximating the Geometric Knapsack Problem in Near-Linear Time and Dynamically.
Moritz BuchemPaul DeukerAndreas WiesePublished in: CoRR (2024)
Keyphrases
- knapsack problem
- combinatorial optimization problems
- optimal solution
- test problems
- dynamic programming
- optimization problems
- greedy algorithm
- multidimensional knapsack problem
- exact algorithms
- np hard
- worst case
- linear programming relaxation
- np hard problems
- bicriteria
- heuristic solution
- continuous relaxation
- maximum profit
- cutting plane
- greedy heuristic
- multiple objectives
- decision variables
- implicit enumeration