Analytical models for locating undesirable facilities
From MaRDI portal
Publication:1118522
DOI10.1016/0377-2217(89)90420-7zbMath0668.90025OpenAlexW2093819975MaRDI QIDQ1118522
Publication date: 1989
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(89)90420-7
Related Items (only showing first 100 items - show all)
Obnoxious facility location in multiple dimensional space ⋮ Complexity and approximability of certain bicriteria location problems ⋮ Optimal algorithms for inverse obnoxious center location problems under the weighted Chebyshev and Hamming cost norms on networks ⋮ A location-allocation model for bio-waste management in the hospitality sector ⋮ Application of facility location modeling constructs to vendor selection problems ⋮ Asymmetric distance location model ⋮ A new bound and an \(O(mn)\) algorithm for the undesirable 1-median problem (maxian) on networks ⋮ Robust facility location problem for hazardous waste transportation ⋮ Facility dispersion and remote subgraphs ⋮ The location of ambivalent facilities: Use of a quadratic zero-one programming algorithm ⋮ Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem ⋮ An integer programming approach for solving the \(p\)-dispersion problem ⋮ Multiobjective analysis of facility location decisions ⋮ The minimum weighted covering location problem with distance constraints ⋮ Locating a semi-obnoxious facility with expropriation ⋮ A new model for the hazardous waste location-routing problem ⋮ Hazardous waste management problem: the case for incineration ⋮ Undesirable facility location problems on multicriteria networks ⋮ Solving the semi-desirable facility location problem using bi-objective particle swarm ⋮ Solving a multiobjective location routing problem with a metaheuristic based on tabu search. Application to a real case in Andalusia ⋮ \(p\)-median and \(p\)-dispersion problems: a bi-criteria analysis ⋮ The Weber obnoxious facility location model: a big arc small arc approach ⋮ Multiobjective programming for sizing and locating biogas plants: a model and an application in a region of Portugal ⋮ Strategy-Proof Mechanism for Obnoxious Facility Location on a Line ⋮ Covering a simplex by spheres: complexity and algorithms ⋮ An \(O(mn)\) algorithm for the anti-cent-dian problem ⋮ A triobjective model for locating a public semiobnoxious facility in the plane ⋮ Interactions between operational research and environmental management ⋮ Subset selection from large datasets for kriging modeling ⋮ Use of reference points for solving MONLP problems ⋮ A two-phase intensification tabu search algorithm for the maximum min-sum dispersion problem ⋮ Review of obnoxious facilities location problems ⋮ Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS ⋮ Lagrangian solution of maximum dispersion problems ⋮ A bi-objective modeling approach applied to an urban semi-desirable facility location problem ⋮ An agent-based framework for modeling and solving location problems ⋮ A review on discrete diversity and dispersion maximization from an OR perspective ⋮ Comments on ‘Facility location problem on network under multiple criteria fuzzy set theoretic approach’ ⋮ Compact location problems ⋮ Compact location problems with budget and communication constraints ⋮ A parallel variable neighborhood search approach for the obnoxious p‐median problem ⋮ The dispersive art gallery problem ⋮ Location Science in Canada ⋮ Siting noxious facilities: efficiency and majority rule decisions ⋮ Sequential competitive location on networks ⋮ Discrete facility location and routing of obnoxious activities. ⋮ The discrete p-dispersion problem ⋮ Alternative formulations for the obnoxious \(p\)-median problem ⋮ A branch-and-cut method for the obnoxious \(p\)-median problem ⋮ A continuous location model for siting a non-noxious undesirable facility within a geographical region ⋮ Locating a low-level waste disposal site ⋮ An iterated local search for the budget constrained generalized maximal covering location problem ⋮ New models for the location of controversial facilities: a bilevel programming approach ⋮ Location of a facility minimizing nuisance to or from a planar network ⋮ The obnoxious facilities planar \(p\)-median problem ⋮ The minimal covering location and sizing problem in the presence of gradual cooperative coverage ⋮ Heuristic solution approaches for the maximum minsum dispersion problem ⋮ Unnamed Item ⋮ A new compact formulation for the discrete \(p\)-dispersion problem ⋮ Solving the maximum min-sum dispersion by alternating formulations of two different problems ⋮ A multiobjective model for locating undesirable facilities ⋮ Maximum diversity/similarity models with extension to part grouping ⋮ Confined location of facilities on a graph ⋮ A new local search for continuous location problems ⋮ A bi-objective model for the location of landfills for municipal solid waste ⋮ Transmitter location for maximum coverage and constructive-destructive interference management ⋮ The ordered gradual covering location problem on a network ⋮ Discrete location problems with push-pull objectives ⋮ On the ordered anti-Weber problem for any norm in \(\mathbb R^2\) ⋮ Facility location models for distribution system design ⋮ Planar expropriation problem with non-rigid rectangular facilities ⋮ Hybrid biobjective evolutionary algorithms for the design of a hospital waste management network ⋮ Location analysis: a synthesis and survey ⋮ The β-reliable minimax and maximin location problems on a network with probabilistic weights ⋮ Approximation strategy-proof mechanisms for obnoxious facility location on a line ⋮ A fractional model for locating semi-desirable facilities on networks ⋮ Measuring diversity. A review and an empirical analysis ⋮ Construction and improvement algorithms for dispersion problems ⋮ Dispersing obnoxious facilities on a graph ⋮ Public facility location using dispersion, population, and equity criteria ⋮ The equitable dispersion problem ⋮ Undesirable facility location with minimal covering objectives ⋮ Strategic facility location: A review ⋮ Dispersing Obnoxious Facilities on a Graph ⋮ Efficiency for continuous facility location problems with attraction and repulsion ⋮ A robust and efficient algorithm for planar competitive location problems ⋮ Aggregation error for location models: Survey and analysis ⋮ Combined location-routing problems -- a neural network approach ⋮ The discrete p-maxian location problem ⋮ Repulsion-based p-dispersion with distance constraints in non-convex polygons ⋮ Linear time optimal approaches for reverse obnoxious center location problems on networks ⋮ Maximin location: Discretization not always works ⋮ Use of location-allocation models in health service development planning in developing nations ⋮ Semi-obnoxious location models: A global optimization approach ⋮ Some personal views on the current state and the future of locational analysis ⋮ A note on the location of an obnoxious facility on a network ⋮ Location of an undesirable facility in a polygonal region with forbidden zones ⋮ The Location of Undesirable Facilities ⋮ Stochastic Analysis in Location Research ⋮ Obnoxious-facility location and data-envelopment analysis: a combined distance-based formula\-tion
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Location and layout planning. An international bibliography
- 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
- Easy and hard bottleneck location problems
- Relations between packing and covering numbers of a tree
- The discrete p-maxian location problem
- An Analysis of Network Location Problems with Distance Constraints
- Minimax and maximin facility location problems on a sphere
- State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
- A heuristic approach to the single facility maximin location problem
- Location of Multiple Obnoxious Facilities
- New approach to facility locations decisions
- An Enhancement of the Drezner-Wesolowsky Algorithm for Single-Facility Location with Maximin of Rectilinear Distance
- An Efficient Computational Procedure for the Rectilinear MAXIMIN Location Problem
- A Maxmin Location Problem
- Polynomially bounded algorithms for locatingp-centers on a tree
- Duality and Distance Constraints for the Nonlinear p-Center Problem and Covering Problem on a Tree Network
- A Trajectory Method for the Optimization of the Multi-Facility Location Problem With lp Distances
- Location on Tree Networks: P-Centre and n-Dispersion Problems
- Single Facility $l_p $-Distance Minimax Location
This page was built for publication: Analytical models for locating undesirable facilities
