An FPTAS for the knapsack problem with parametric weights.
Nir HalmanMichael HolzhauserSven O. KrumkePublished in: Oper. Res. Lett. (2018)
Keyphrases
- knapsack problem
- combinatorial optimization problems
- dynamic programming
- optimal solution
- test problems
- np hard
- optimization problems
- multidimensional knapsack problem
- exact algorithms
- linear programming relaxation
- approximation algorithms
- heuristic solution
- bicriteria
- np hardness
- greedy algorithm
- np hard problems
- weighted sum
- continuous relaxation
- greedy heuristic
- multiple objectives
- cutting plane
- computational complexity
- multi objective
- machine learning
- neural network