A weighting-based local search heuristic algorithm for the Set Covering Problem.
Chao GaoThomas WeiseJinlong LiPublished in: IEEE Congress on Evolutionary Computation (2014)
Keyphrases
- set covering problem
- pareto local search
- set covering
- bi objective
- branch and bound algorithm
- neighborhood search
- column generation
- integer programming
- combinatorial optimization
- search algorithm
- optimal solution
- genetic algorithm
- search space
- simulated annealing
- tabu search
- branch and bound
- memetic algorithm
- efficient solutions
- lower bound
- constraint satisfaction
- shortest path problem