Covering problems constitute a fundamental family of facility location problems. This paper
introduces a new exact algorithm for two important members of this family:(i) the maximal …

Thetermmemeticalgorithms [1](MAs) wasintroducedinthelate1980stodenoteafam… that have
as central theme the hybridization of different algorithmic approaches for a given problem …

In complexity theory, there is a widely studied grouping of optimization problems that
belongs to the non-deterministic polynomial-time hard set. One of them is the set covering …

The set covering problem (SCP) is an NP‐complete optimization problem, fitting with many
problems in engineering. The traditional SCP formulation does not directly address both …

In this paper, we introduce a mixed integer quadratic formulation for the congested variant of
the partial set covering location problem, which involves determining a subset of facility …

The profit maximization set covering problem is a general model able to formulate practical
problems including in particular an application in the mining industry. As a variant of the …

The key available information to choose new locations for drilling are the estimated ore
grade values and the corresponding uncertainties at the tentative locations. These pieces of …

Purpose Liquefied petroleum gas (LPG) transportation risks depend on aspects such as the
total length of the trip and population density along the route. Choosing to deliver the …

In this paper, we analyze a new variant of the well-known NP-hard Set Covering Problem,
characterized by pairwise conflicts among subsets of items. Two subsets in conflict can …

Given an edge‐weighted undirected graph with weights specifying dissimilarities between
pairs of objects, represented by the vertices of the graph, the clique partitioning problem …