Approximation of the Clustered Set Covering Problem.

Laurent Alfandari Jérôme Monnot

Published in: Electron. Notes Discret. Math. (2010)

Keyphrases

set covering problem
set covering
pareto local search
integer programming
bi objective
branch and bound algorithm
column generation
approximation algorithms
multi objective
branch and bound
genetic algorithm
search algorithm
network design
lower bound
np hard