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