Consider a graph G, in which the set of vertices represents the set of demand points as well as the set of potential facility sites. The classical covering location problem seeks to minimize the total location cost required to cover all vertices of G. The conditional covering problem (CCP) has the same objective but with an additional constraint: each selected facility site must be covered by a...

Focus of this paper is the evaluation and optimization of automatic network planning algorithms considering different communication technologies supporting Smart Grid communication infrastructures. Therefore, a performance evaluation and sensitivity analysis of parameters of greedy-based algorithms solving the covering-location problem are implemented and analyzed in a discrete-event simulation...

The location planning of emergency service stations is crucial, especially in the populated cities with heavy traffic conditions such as Istanbul. In this paper, we propose a Backup Double Covering Model (BDCM), a variant of the well-known Maximal Covering Location Problem, that requires two types of services to plan the emergency service stations. The objective of the model is to maximize the ...