Maximizing the number of obnoxious facilities to locate within a bounded region

DOI10.1016/J.COR.2009.04.004MaRDI QIDQ733537zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

approximate solutionabnoxious multifacility location

Mathematics Subject Classification ID

Continuous location (90B85)

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

• scientific article; zbMATH DE number 1696648 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 1253055 (Why is no real title available?)
• Approximation of geometric dispersion problems
• Approximation schemes for covering and packing problems in image processing and VLSI
• Dynamic fractional cascading
• Improved algorithms for placing undesirable facilities
• Locating two obnoxious facilities using the weighted maximin criterion
• Obnoxious facility location: complete service with minimal harm
• Optimal packing and covering in the plane are NP-complete
• The multifacility maximin planar location problem with facility interaction

Cited in

(10)

• Locating an obnoxious facility on a euclidean network to minimize neighborhood damage
• 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
• Efficient approximations for the online dispersion problem
• 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)