Continuous covering location problems
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].
- Center location problems on tree graphs with subtree-shaped customers
- The variable radius covering problem
- Continuous location problems and big triangle small triangle: Constructing better bounds
- An extended continuous maximal covering location problem with facility placement
- Location and layout planning. A survey
- The gradual covering decay location problem on a network.
- A multi-objective facility location problem in the presence of variable gradual coverage performance and cooperative cover
- Benders decomposition for very large scale partial set covering and maximal covering location problems
- Optimization of competitive facility location for chain stores
- Speeding up the optimal method of Drezner for the \(p\)-centre problem in the plane
- A continuous covering location model with risk consideration
- On \(k\) nearest points of a finite set in a normed linear space
- A dual algorithm for the minimum covering weighted ball problem in \({\mathbb{R}^n}\)
- Cooperative cover of uniform demand
- Covering problems with polyellipsoids: a location analysis perspective
- A dual simplex-type algorithm for the smallest enclosing ball of balls
- A branch-and-bound method for the minimum \(k\)-enclosing ball problem
- Unmanned aerial vehicle set covering problem considering fixed-radius coverage constraint
- The pos/neg-weighted 1-median problem on tree graphs with subtree-shaped customers
- Locating a minisum annulus: a new partial coverage distance model
- Locating a semi-obnoxious covering facility with repelling polygonal regions
- Alternative fuel station location model with demand learning
- The continuous \(p\)-centre problem: an investigation into variable neighbourhood search with memory
- Optimizing some constructions with bars: new geometric knapsack problems
- Minmax regret maximal covering location problems with edge demands
- Upgrading edges in the maximal covering location problem
- Covering part of a planar network
- A primal algorithm for the weighted minimum covering ball problem in \(\mathbb {R}^n\)
- Continuous space maximal coverage: insights, advances and challenges
- An adaptive perturbation-based heuristic: an application to the continuous p-centre problem
- Covering continuous demand in the plane
- Sequential competitive location on networks
- A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments
- On a robustness property in single-facility location in continuous space
- The maximin gradual cover location problem
- An iterated local search for the budget constrained generalized maximal covering location problem
- The minimum covering Euclidean ball of a set of Euclidean balls in \(\mathbb{R}^n\)
- An agent-based framework for modeling and solving location problems
- A faster dual algorithm for the Euclidean minimum covering ball problem
- Ultrametric location and parsimonious representation
- Unmanned aerial vehicle variable radius set covering problem for emergency wireless network
- Planar expropriation problem with non-rigid rectangular facilities
- A dual algorithm for the minimum covering ball problem in \(\mathbb R^n\)
- The maximin line problem with regional demand
- Generalized coverage: new developments in covering location models
- The pos/neg-weighted median problem on block graphs with subgraph-shaped customers
This page was built for publication: Continuous covering location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3147657)
