Maximizing the number of obnoxious facilities to locate within a bounded region
From MaRDI portal
Publication:733537
DOI10.1016/j.cor.2009.04.004zbMath1171.90455OpenAlexW2123894468MaRDI QIDQ733537
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
Related Items (5)
Dispersing facilities on planar segment and circle amidst repulsion ⋮ Efficient Approximations for the Online Dispersion Problem ⋮ Formulation and algorithms for the robust maximal covering location problem ⋮ Dispersing obnoxious facilities on a graph ⋮ Dispersing Obnoxious Facilities on a Graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dynamic fractional cascading
- Optimal packing and covering in the plane are NP-complete
- Improved algorithms for placing undesirable facilities
- Locating two obnoxious facilities using the weighted maximin criterion
- OBNOXIOUS FACILITY LOCATION: COMPLETE SERVICE WITH MINIMAL HARM
- Approximation schemes for covering and packing problems in image processing and VLSI
- The multifacility maximin planar location problem with facility interaction
- Approximation of geometric dispersion problems
This page was built for publication: Maximizing the number of obnoxious facilities to locate within a bounded region
