Continuous covering location problems (Q3147657)

The author focuses on the location problems, when facilities are allowed to be located in the arbitrary point of a given continuous region, for example in a plain or in \(n\)-dimensional Euclidean space. In these location problems the facility should cover demands of demand points, which form finite set. For various types of distances the basic full covering problem was introduced in the paper and minimal covering circle rules were established and used as a keystone for the associated solving methods. The next topics, which were dealt with, are maximal covering problem and empty covering problem. The objective of the first one is to cover as much demands as possible by a circle with the given radius. The second case involves obnoxious centre location. Two other problems are related here to this problem. These are minimal covering problem and maximal radius problem. The former problem seeks for circle, radius of which is given and which covers minimum demand. The later one arises question, what is the maximal radius so that covered demand does not exceed a given limit. The rest of the contribution is devoted to overview of push-pull covering models, positioning models, multiple facility covering location models and extensive facility covering location models, when facilities has a shape different from a simple point. For the entire collection see [Zbl 0988.00044].