A 3-flip neighborhood local search for the set covering problem.
Mutsunori YagiuraMasahiro KishidaToshihide IbarakiPublished in: Eur. J. Oper. Res. (2006)
Keyphrases
- set covering problem
- pareto local search
- set covering
- bi objective
- branch and bound algorithm
- integer programming
- column generation
- combinatorial optimization
- search algorithm
- optimal solution
- genetic algorithm
- efficient solutions
- branch and bound
- memetic algorithm
- lower bound
- search space
- neighborhood search
- search strategies
- metaheuristic
- np hard
- multi objective