A heuristic for the non-unicost set covering problem using local branching.
John E. BeasleyPublished in: Int. Trans. Oper. Res. (2024)
Keyphrases
- set covering problem
- set covering
- branch and bound algorithm
- branch and bound
- column generation
- integer programming
- search tree
- bi objective
- lower bound
- search algorithm
- combinatorial optimization
- linear programming
- optimal solution
- pareto local search
- dynamic programming
- np hard
- special case
- random walk
- test problems