A Parameterized Approximation Scheme for the Geometric Knapsack Problem with Wide Items.
Mathieu MariTimothé PicavetMichal PilipczukPublished in: IPEC (2023)
Keyphrases
- knapsack problem
- combinatorial optimization problems
- linear programming relaxation
- np hard
- optimal solution
- polynomial time approximation
- exact algorithms
- approximation schemes
- optimization problems
- test problems
- dynamic programming
- approximation algorithms
- randomized approximation
- heuristic solution
- multidimensional knapsack problem
- multiple objectives
- cutting plane
- greedy heuristic
- continuous relaxation
- maximum profit
- greedy algorithm
- bicriteria
- metaheuristic
- linear program
- cost function