A Local Branching Approach for the Set Covering Problem

The set covering problem (scp) is a well-known combinatorial optimization problem. this paper investigates development of a local branching-based solution approach for the scp. this solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. the algorithm parameters are tuned by design of experiments approach. the proposed method is tested on the several standard instances. the results show that the algorithm outperforms the best heuristic approaches found in the literature.