Undesirable facility location with minimal covering objectives
From MaRDI portal
Publication:1806769
DOI10.1016/S0377-2217(98)00335-XzbMath0934.90051OpenAlexW2021035801MaRDI QIDQ1806769
Emilio Carrizosa, Frank Plastria
Publication date: 8 November 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(98)00335-x
Voronoi diagramEuclidean distanceminimal coveringundesirable facility locationlargest circlebicriterion covering problem
Related Items
Minimal covering unrestricted location of obnoxious facilities: bi-objective formulation and a case study ⋮ The probabilistic customer's choice rule with a threshold attraction value: effect on the location of competitive facilities in the plane ⋮ A polyhedral approach to bisubmodular function minimization ⋮ Review of obnoxious facilities location problems ⋮ A multi-objective facility location problem in the presence of variable gradual coverage performance and cooperative cover ⋮ Solving the 1-median problem on a network with continuous demand and demand surplus ⋮ A general model for the undesirable single facility location problem ⋮ Location of a facility minimizing nuisance to or from a planar network ⋮ The minimal covering location and sizing problem in the presence of gradual cooperative coverage ⋮ Location of a semi-obnoxious facility with elliptic maximin and network minisum objectives ⋮ On the ordered anti-Weber problem for any norm in \(\mathbb R^2\) ⋮ Planar expropriation problem with non-rigid rectangular facilities ⋮ Euclidean push--pull partial covering problems ⋮ A defensive maximal covering problem on a network ⋮ Multiple criteria facility location problems: a survey ⋮ Low complexity algorithms for optimal consumer push-pull partial covering in the plane ⋮ Efficiency for continuous facility location problems with attraction and repulsion ⋮ The variable radius covering problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A destination optimality in asymmetric distance Fermat-Weber problems
- Locating an undesirable facility with a minimax criterion
- Analytical models for locating undesirable facilities
- An O\((n \log{}n)\) algorithm for a maxmin location problem
- GBSSS: The generalized big square small square method for planar single- facility location
- A branch-and-bound algorithm for the location of facilities causing atmospheric pollution
- Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints
- On minquantile and maxcovering optimisation
- An \(O(mn^ 2)\) algorithm for the maximin problem in \(E^ 2\)
- Computing largest empty circles with location constraints
- An Algorithm for Large Zero-One Knapsack Problems
