So far we have studied the set covering problem, but not looked at any real life applications. The shortest superstring problem takes as input, several strings of different lengths and finds the shortest string that contains all the input strings as substrings. This is helpful in the genome project since it will allow researchers to determine entire coding regions from a collection of fragmente...

The set covering problem (SCP) is a classical combinatorial optimization part of Karp's 21 NP-complete problems. Many real-world applications can be modeled as problems (SCPs), such locating emergency services, military planning, and decision-making in COVID-19 pandemic context. Among the approaches that this type has solved are heuristic (H) metaheuristic (MH) algorithms, which integrate itera...

<p style='text-indent:20px;'>In this paper, a fuzzy linear fractional set covering problem is solved. The non-linearity of the objective function as well its fuzziness make it difficult and complex to be solved effectively. To overcome these difficulties, using concepts theory component-wise optimization, converted crisp multi-objective non-linear problem. In order tackle obtained problem...

Abstract One of the basic assumptions in hub covering problems is considering the covering radius as an exogenous parameter which cannot be controlled by the decision maker. Practically and in many real world cases with a negligible increase in costs, to increase the covering radii, it is possible to save the costs of establishing additional hub nodes. Change in problem parameters during the pl...

Set covering problem is a classical problem in computer science and complexity theory. It has many applications, such as airline crew scheduling problem, facilities location problem, vehicle routing, assignment problem, etc. In this paper, three different techniques are applied to solve set covering problem. Firstly, a mathematical model of set covering problem is introduced and solved by using...