Maximizing the number of obnoxious facilities to locate within a bounded region
From MaRDI portal
Publication:733537
DOI10.1016/J.COR.2009.04.004zbMATH Open1171.90455OpenAlexW2123894468MaRDI QIDQ733537FDOQ733537
Authors: Shimon Abravaya, Michael Segal 
Publication date: 16 October 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2009.04.004
Recommendations
- Locating two obnoxious facilities using the weighted maximin criterion
- scientific article; zbMATH DE number 1696648
- scientific article; zbMATH DE number 4100913
- Obnoxious Facility Location on Graphs
- Locating an undesirable facility with a minimax criterion
- scientific article; zbMATH DE number 961966
- Probabilistic single obnoxious facility location with fixed budget
- Locating an obnoxious facility on a euclidean network to minimize neighborhood damage
- scientific article; zbMATH DE number 2111731
- Locating facilities by minimax relative to closest points of demand areas
Cites Work
- Title not available (Why is that?)
- Approximation schemes for covering and packing problems in image processing and VLSI
- Dynamic fractional cascading
- Locating two obnoxious facilities using the weighted maximin criterion
- Optimal packing and covering in the plane are NP-complete
- Approximation of geometric dispersion problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Improved algorithms for placing undesirable facilities
- Obnoxious facility location: complete service with minimal harm
- The multifacility maximin planar location problem with facility interaction
Cited In (10)
- Locating an obnoxious facility on a euclidean network to minimize neighborhood damage
- Efficient Approximations for the Online Dispersion Problem
- Location of an undesirable facility in a polygonal region with forbidden zones
- Formulation and algorithms for the robust maximal covering location problem
- Dispersing obnoxious facilities on a graph
- OBNOXIOUS FACILITY LOCATION: THE CASE OF WEIGHTED DEMAND POINTS
- Computing an obnoxious anchored segment.
- Discrete facility location and routing of obnoxious activities.
- Improved algorithms for placing undesirable facilities
- Dispersing Obnoxious Facilities on a Graph
This page was built for publication: Maximizing the number of obnoxious facilities to locate within a bounded region
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q733537)
