An FPTAS for the parametric knapsack problem.
Michael HolzhauserSven O. KrumkePublished in: Inf. Process. Lett. (2017)
Keyphrases
- knapsack problem
- combinatorial optimization problems
- np hard
- optimization problems
- optimal solution
- dynamic programming
- test problems
- bicriteria
- multidimensional knapsack problem
- greedy algorithm
- np hardness
- exact algorithms
- approximation algorithms
- continuous relaxation
- np hard problems
- maximum profit
- objective function
- greedy heuristic
- cutting plane
- genetic algorithm
- linear programming relaxation
- multiple objectives
- metaheuristic