In this study, we review the covering problems in facility location. Here, besides a number of
reviews on covering problems, a comprehensive review of models, solutions and …

Much research in the area of constraint processing has recently been focused on extracting
small unsatisfiable “cores” from unsatisfiable constraint systems with the goal of finding …

Given a delimited surveillance area, represented in either 2D or 3D, and a set of feasible
camera locations and orientations, the optimal camera placement problem (OCP) is that of …

The set covering problem (SCP) is a fundamental NP-hard problem in computer science and
has a broad range of important real-world applications. In practice, SCP instances …

In this paper we propose a new heuristic algorithm to solve the unicost version of the well-
known set covering problem. The method is based on the electromagnetism metaheuristic …

The unicost version of well-known set covering problem (SCP) is central to a wide variety of
practical applications for which finding an optimal solution quickly is crucial. In this paper, we …

Abstract The Set Covering Problem (SCP) is NP-hard. We propose a new Row Weighting
Local Search (RWLS) algorithm for solving the unicost variant of the SCP, ie, USCPs where …

The set covering problem (SCP) is a well known classic combinatorial NP-hard problem,
having practical application in many fields. To optimize the objective function of the SCP …

In many covering problems, services that customers receive by facilities depend on the
distance between the customer and facilities. In a covering problem the customer can …

We introduce a new continuous location-allocation problem where the facilities have both a
fixed opening cost and a coverage distance limitation. The problem has wide applications …