An FPTAS for the parametric knapsack problem.
Michael HolzhauserSven O. KrumkePublished in: CoRR (2017)
Keyphrases
- knapsack problem
- combinatorial optimization problems
- dynamic programming
- optimal solution
- multidimensional knapsack problem
- test problems
- np hard
- optimization problems
- greedy algorithm
- approximation algorithms
- linear programming relaxation
- bicriteria
- exact algorithms
- np hard problems
- greedy heuristic
- multiple objectives
- np hardness
- maximum profit
- continuous relaxation
- timed automata
- neural network
- heuristic solution
- particle swarm optimization
- linear programming