A Heuristic Approach for Minimum Set Cover Problem
Fatema Akhter · INTERNATIONAL JOURNAL OF ADVANCED RESEARCH IN ARTIFICIAL INTELLIGENCE · 2015
The Minimum Set Cover Problem has many prac-tical applications in various research areas. This problem belongs to the class of NP-hard theoretical problems. Several approxima-tion algorithms have been proposed to find approximate solutions to this problem and research is still going on to optimize the solution. This paper studies the existing algorithms of minimum set cover problem and proposes a heuristic approach to solve the problem using modified hill climbing algorithm. The effectiveness of the approach is tested on set cover problem instances from OR-Library. The experimental results show the effectiveness of our proposed approach.