Approximation of the Quadratic Set Covering problem.
Bruno EscoffierPeter L. HammerPublished in: Discret. Optim. (2007)
Keyphrases
- set covering problem
- set covering
- pareto local search
- integer programming
- branch and bound algorithm
- column generation
- bi objective
- taylor series expansion
- branch and bound
- lower bound
- computational complexity
- upper bound
- objective function
- genetic algorithm
- approximation algorithms
- search algorithm
- efficient solutions
- optimal solution
- reinforcement learning