An FPTAS for the Knapsack Problem with Parametric Weights.
Michael HolzhauserSven Oliver KrumkePublished in: CoRR (2017)
Keyphrases
- knapsack problem
- combinatorial optimization problems
- optimal solution
- test problems
- dynamic programming
- exact algorithms
- np hard
- optimization problems
- greedy algorithm
- bicriteria
- multidimensional knapsack problem
- linear programming relaxation
- weighted sum
- np hardness
- np hard problems
- continuous relaxation
- heuristic solution
- greedy heuristic
- timed automata
- approximation algorithms
- special case
- decision variables
- metaheuristic
- shortest path
- maximum profit