Faster Approximation Schemes for the Two-Dimensional Knapsack Problem.
Sandy HeydrichAndreas WiesePublished in: ACM Trans. Algorithms (2019)
Keyphrases
- knapsack problem
- approximation schemes
- approximation algorithms
- np hard
- combinatorial optimization problems
- optimal solution
- dynamic programming
- optimization problems
- exact algorithms
- multidimensional knapsack problem
- greedy algorithm
- linear programming relaxation
- continuous relaxation
- numerical methods
- bicriteria
- greedy heuristic
- implicit enumeration
- decision variables
- maximum profit
- differential equations
- machine learning
- branch and bound
- cost function
- evolutionary algorithm
- multiscale