A parameterized approximation scheme for the 2D-Knapsack problem with wide items.
Michal PilipczukMathieu MariTimothé PicavetPublished in: CoRR (2023)
Keyphrases
- knapsack problem
- combinatorial optimization problems
- linear programming relaxation
- test problems
- optimal solution
- np hard
- polynomial time approximation
- dynamic programming
- optimization problems
- multidimensional knapsack problem
- randomized approximation
- np hard problems
- exact algorithms
- approximation schemes
- greedy algorithm
- greedy heuristic
- heuristic solution
- approximation algorithms
- bicriteria
- multiple objectives
- maximum profit
- cutting plane
- relaxation algorithm
- genetic algorithm