The Location of Undesirable Facilities
From MaRDI portal
Publication:5506725
DOI10.1007/978-1-4419-7572-0_10zbMath1388.90076OpenAlexW107461514MaRDI QIDQ5506725
Publication date: 16 December 2016
Published in: International Series in Operations Research & Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4419-7572-0_10
Related Items (5)
The Weber obnoxious facility location model: a big arc small arc approach ⋮ Locating a minisum annulus: a new partial coverage distance model ⋮ Review of obnoxious facilities location problems ⋮ Location of a semi-obnoxious facility with elliptic maximin and network minisum objectives ⋮ Transmitter location for maximum coverage and constructive-destructive interference management
Cites Work
- Unnamed Item
- Good solutions to discrete noxious location problems via metaheuristics
- Location-routing: issues, models and methods
- Solving the semi-desirable facility location problem using bi-objective particle swarm
- The discrete p-dispersion problem
- Locating an undesirable facility with a minimax criterion
- Determining an optimum location for an undesirable facility in a workroom environment
- A single facility location problem with a weighted maximin-minimax rectilinear distance
- Analytical models for locating undesirable facilities
- 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
- An \(O(mn)\) algorithm for the 1-maximin problem on a network
- Semi-obnoxious single facility location in Euclidean space.
- A note on the location of an obnoxious facility on a network
- Location analysis: a synthesis and survey
- The bicriterion semi-obnoxious location (BSL) problem solved by an \(\varepsilon\)-approximation
- Multicriteria semi-obnoxious network location problems (MSNLP) with sum and center objectives
- An \(O(mn^ 2)\) algorithm for the maximin problem in \(E^ 2\)
- The minimum weighted covering location problem with distance constraints
- A general model for the undesirable single facility location problem
- Upper bounds and exact algorithms for \(p\)-dispersion problems
- An Analysis of Network Location Problems with Distance Constraints
- Linear Time Algorithms for Two- and Three-Variable Linear Programs
- Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures
- An Efficient Computational Procedure for the Rectilinear MAXIMIN Location Problem
- A Maxmin Location Problem
- Location on Tree Networks: P-Centre and n-Dispersion Problems
- Finite Dominating Sets for Network Location Problems
- Obnoxious Facility Location on Graphs
- Technical Note—The Discrete Anti-P-Center Problem
- Solving Structured Multifacility Location Problems Efficiently
- The expropriation location problem
- Mixed integer programming-based solution procedure for single-facility location with maximin of rectilinear distance
- Locating semi-obnoxious facilities with expropriation: minisum criterion
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- The maximin-maxisum network location problem
This page was built for publication: The Location of Undesirable Facilities
