Undesirable facility location with minimal covering objectives

DOI10.1016/S0377-2217(98)00335-XzbMATH Open0934.90051OpenAlexW2021035801MaRDI QIDQ1806769FDOQ1806769

Authors: Frank Plastria, Emilio Carrizosa 

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

Recommendations

• Location of an undesirable facility in a polygonal region with forbidden zones
• Locating an undesirable facility with a minimax criterion
• The minimum weighted covering location problem with distance constraints
• Improved algorithms for placing undesirable facilities
• Location of Multiple Obnoxious Facilities

zbMATH Keywords

Voronoi diagramEuclidean distanceminimal coveringundesirable facility locationlargest circlebicriterion covering problem

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An Algorithm for Large Zero-One Knapsack Problems
• GBSSS: The generalized big square small square method for planar single- facility location
• Computing largest empty circles with location constraints
• Title not available (Why is that?)
• Analytical models for locating undesirable facilities
• Title not available (Why is that?)
• A destination optimality in asymmetric distance Fermat-Weber problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On minquantile and maxcovering optimisation
• A branch-and-bound algorithm for the location of facilities causing atmospheric pollution
• Locating an undesirable facility with a minimax criterion
• An \(O(mn^ 2)\) algorithm for the maximin problem in \(E^ 2\)
• Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints
• An O\((n \log{}n)\) algorithm for a maxmin location problem
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (22)

• Minimal covering unrestricted location of obnoxious facilities: bi-objective formulation and a case study
• On the ordered anti-Weber problem for any norm in \(\mathbb R^2\)
• Planar expropriation problem with non-rigid rectangular facilities
• The probabilistic customer's choice rule with a threshold attraction value: effect on the location of competitive facilities in the plane
• Location of facilities with undesirable effects and inverse location problems: A classification
• Multiple criteria facility location problems: a survey
• The minimal covering location and sizing problem in the presence of gradual cooperative coverage
• Review of obnoxious facilities location problems
• Location of a facility minimizing nuisance to or from a planar network
• Low complexity algorithms for optimal consumer push-pull partial covering in the plane
• Efficiency for continuous facility location problems with attraction and repulsion
• A polyhedral approach to bisubmodular function minimization
• A general model for the undesirable single facility location problem
• A multi-objective facility location problem in the presence of variable gradual coverage performance and cooperative cover
• Discrete cooperative coverage location models with alternative facility types in a probabilistic setting
• The minimum weighted covering location problem with distance constraints
• A defensive maximal covering problem on a network
• The variable radius covering problem
• Multiple obnoxious facility location: the case of protected areas
• Euclidean push--pull partial covering problems
• Location of a semi-obnoxious facility with elliptic maximin and network minisum objectives
• Solving the 1-median problem on a network with continuous demand and demand surplus

This page was built for publication: Undesirable facility location with minimal covering objectives

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1806769)