Location of a facility minimizing nuisance to or from a planar network

DOI10.1016/j.cor.2007.08.004zbMath1163.90618OpenAlexW2025915206MaRDI QIDQ947950

Zvi Drezner, Carlton H. Scott, Tammy Drezner

Publication date: 8 October 2008

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

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

zbMATH Keywords

locationplanar networkobnoxioushazard transport

Mathematics Subject Classification ID

Continuous location (90B85)

Related Items (7)

Covering part of a planar network ⋮ The Weber obnoxious facility location model: a big arc small arc approach ⋮ A Lagrangian heuristic algorithm for a public healthcare facility location problem ⋮ Review of obnoxious facilities location problems ⋮ A projected Weiszfeld algorithm for the box-constrained Weber location problem ⋮ The obnoxious facilities planar \(p\)-median problem ⋮ Big segment small segment global optimization algorithm on networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A general global optimization approach for solving location problems in the plane
• Analytical models for locating undesirable facilities
• Locating an obnoxious facility
• GBSSS: The generalized big square small square method for planar single- facility location
• Semi-obnoxious location models: A global optimization approach
• Location of an undesirable facility in a polygonal region with forbidden zones
• Undesirable facility location with minimal covering objectives
• Locating an Undesirable Facility by Generalized Cutting Planes
• IMPROVEMENTS OF THE INCREMENTAL METHOD FOR THE VORONOI DIAGRAM WITH COMPUTATIONAL COMPARISON OF VARIOUS ALGORITHMS
• The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
• Obnoxious Facility Location on Graphs
• A ROBUST TOPOLOGY-ORIENTED INCREMENTAL ALGORITHM FOR VORONOI DIAGRAMS

This page was built for publication: Location of a facility minimizing nuisance to or from a planar network