A novel local search for unicost set covering problem using hyperedge configuration checking and weight diversity.
Yiyuan WangDantong OuyangLiming ZhangMinghao YinPublished in: Sci. China Inf. Sci. (2017)
Keyphrases
- set covering problem
- pareto local search
- set covering
- branch and bound algorithm
- integer programming
- column generation
- bi objective
- optimal solution
- search algorithm
- combinatorial optimization
- search space
- genetic algorithm
- tabu search
- linear programming
- constraint satisfaction
- lower bound
- search procedure
- branch and bound
- constraint programming
- test problems
- knapsack problem
- memetic algorithm
- job shop scheduling problem
- np hard
- neighborhood search
- markov decision processes