A note on "Approximation schemes for a subclass of subset selection problems", and a faster FPTAS for the Minimum Knapsack Problem.
Cédric BentzPierre Le BodicPublished in: CoRR (2016)
Keyphrases
- knapsack problem
- approximation schemes
- subset selection
- optimization problems
- approximation algorithms
- test problems
- exact algorithms
- np hard problems
- combinatorial optimization problems
- multidimensional knapsack problem
- np hard
- continuous relaxation
- np complete
- feature selection
- metaheuristic
- optimal solution
- dynamic programming
- cost function
- greedy algorithm
- linear program
- linear programming relaxation
- lp relaxation
- quadratic program
- special case
- integer variables
- neural network