An efficient local search heuristic with row weighting for the unicost set covering problem.
Chao GaoXin YaoThomas WeiseJinlong LiPublished in: Eur. J. Oper. Res. (2015)
Keyphrases
- set covering problem
- pareto local search
- set covering
- branch and bound algorithm
- integer programming
- bi objective
- column generation
- optimal solution
- combinatorial optimization
- search algorithm
- branch and bound
- tabu search
- constraint programming
- simulated annealing
- feasible solution
- np hard
- memetic algorithm
- search space
- linear programming
- multi objective
- integer program
- domain independent planning
- genetic algorithm