A faster FPTAS for knapsack problem with cardinality constraint.
Wenxin LiJoohyun LeeNess B. ShroffPublished in: Discret. Appl. Math. (2022)
Keyphrases
- knapsack problem
- cardinality constraints
- lp relaxation
- optimal solution
- optimization problems
- dynamic programming
- entity relationship
- exact algorithms
- functional dependencies
- np hard
- integrity constraints
- greedy algorithm
- maximum profit
- database schema
- cutting plane
- approximation algorithms
- deductive databases
- implicit enumeration
- upper bound