مقاله سال ۲۰۱۶

 مجله امگا – Omega

The Maximal Covering Location Problem, (MCLP), [3, 14, 15, 22], is a classic problem in locational analysis with applications in a good number of fields, such as health care, emergency planning, ecology, statistical classification, homeland security, see e.g. [1, 8, 13, 18, 39, 40] and the references therein. Given a finite set of users A, each a ∈ A with demand ωa ≥ ۰, a set of p facilities in a set F is sought in order to maximize the demand covered. A point is said to be covered by a set F∗ ⊂ F of p facilities if there is at least one f ∈ F∗ at distance from a not greater than R, where R > 0 is a fixed number, called the covering radius.