Center Problem (original) (raw)

Abstract

In the covering problems, the attempt is to determine the location of the minimum number of facilities necessary to cover all demand nodes. In this type of problems, the coverage distance is an exogenous data. But sometimes the number of facilities needed to cover all demand nodes with a predefined coverage distance may be quite large. In order to overcome this, the maximum covering location problem has been discussed. In this model, the objective is to maximize the number of covered demand nodes with a fixed number of facilities. In other words, we relaxed the total coverage requirement (Daskin 1995).

Maryam Biazaran hasn't uploaded this paper.

Let Maryam know you want this paper to be uploaded.

Ask for this paper to be uploaded.