Approximation algorithms for knapsack problems with cardinality constraints.
Alberto CapraraHans KellererUlrich PferschyDavid PisingerPublished in: Eur. J. Oper. Res. (2000)
Keyphrases
- approximation algorithms
- cardinality constraints
- knapsack problem
- np hard
- lp relaxation
- exact algorithms
- optimal solution
- combinatorial optimization problems
- special case
- minimum cost
- functional dependencies
- worst case
- optimization problems
- greedy algorithm
- dynamic programming
- entity relationship
- linear programming relaxation
- integer programming
- constant factor
- branch and bound algorithm
- integrity constraints
- lower bound
- production planning
- linear programming
- database schema
- computational complexity
- greedy algorithms
- deductive databases
- evolutionary algorithm
- constraint satisfaction problems
- lagrangian relaxation
- multistage
- genetic algorithm
- database design
- primal dual
- linear program
- closest string