Review of obnoxious facilities location problems

DOI10.1016/j.cor.2021.105468OpenAlexW3182296327MaRDI QIDQ2669654

Zvi Drezner, Richard L. Church

Publication date: 9 March 2022

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2021.105468

zbMATH Keywords

facility locationmathematical modelsobnoxious facilities

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (9)

Extremely non-convex optimization problems: the case of the multiple obnoxious facilities location ⋮ Extensions to the Weber problem ⋮ An efficient heuristic for the \(k\)-partitioning problem ⋮ A trajectory based heuristic for the planar \(p\)-median problem ⋮ Dispersing facilities on planar segment and circle amidst repulsion ⋮ Siting noxious facilities: efficiency and majority rule decisions ⋮ Obnoxious facility location in multiple dimensional space ⋮ The obnoxious competitive facility location model ⋮ Model development and solver demonstrations using randomized test problems

Uses Software

• SNOPT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The disruptive anti-covering location problem
• Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem
• A heuristic for the circle packing problem with a variety of containers
• New approaches to circle packing in a square. With program codes.
• Location of a facility minimizing nuisance to or from a planar network
• Analytical models for locating undesirable facilities
• Integer-friendly formulations for the \(r\)-separation problem
• Facets for node packing
• The gradual covering decay location problem on a network.
• Semi-obnoxious single facility location in Euclidean space.
• The obnoxious center problem on weighted cactus graphs.
• Packing equal circles in a square: A deterministic global optimization approach
• 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
• Location covering models. History, applications and advancements
• Undesirable facility location with minimal covering objectives
• More optimal packings of equal circles in a square
• The discrete p-maxian location problem
• Minimizing the sum of the \(k\) largest functions in linear time.
• New results in the packing of equal circles in a square
• The obnoxious facilities planar \(p\)-median problem
• Location of a semi-obnoxious facility with elliptic maximin and network minisum objectives
• A bi-objective model for the location of landfills for municipal solid waste
• Locating an obnoxious plane
• Locating two obnoxious facilities using the weighted maximin criterion
• On the unified dispersion problem: efficient formulations and exact algorithms
• Voronoi Diagrams and Delaunay Triangulations
• The gradual covering problem
• An Analysis of Network Location Problems with Distance Constraints
• Comparison Of Four Models For dispersing Facilities
• The Weber Problem On The Plane With Some Negative Weights
• The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
• Medi-Centers of a Tree
• A Maxmin Location Problem
• Location on Tree Networks: P-Centre and n-Dispersion Problems
• A multiobjective model for the dynamic location of landfills
• The expropriation location problem
• Solving the Continuous p-Dispersion Problem Using Non-linear Programming
• SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
• The multifacility maximin planar location problem with facility interaction
• The Location of Undesirable Facilities
• Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• A parallel variable neighborhood search approach for the obnoxious p‐median problem
• Solving nonconvex nonlinear programs with reverse convex constraints by sequential linear programming

This page was built for publication: Review of obnoxious facilities location problems