Abstract
Set Covering Problems belong to a class of 0–1 integer programming problems which are NP-complete. The Set Covering Problems have many applications such as location of emergency facilities, truck deliveries, political districting, Air Line Crew Scheduling, Networking and all other programming problems that need the decision variables of the form 0–1. In this paper an enumeration technique is developed to solve the Set Covering Problem using the combinatorial technique. The well-known Breadth First Search technique of graph theory forms the basis of the algorithm. The Set Covering Problems with linear and nonlinear objective functions are discussed. At the end, the concept is extended for Multi- Objective Set Covering Problem. The algorithms developed in the paper are supported by numerical examples.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
