Title of article
Maximizing thenumberofobnoxiousfacilitiestolocatewithinaboundedregion
Author/Authors
Shimon Abravaya، نويسنده , , MichaelSegalb، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2010
Pages
9
From page
163
To page
171
Abstract
This paperdealswiththeproblemoflocatingamaximalcardinalitysetofobnoxiousfacilitieswithina
bounded rectangleintheplanesuchthattheirpairwise L∞-distance aswellasthe L∞-distance toaset
of alreadyplaceddemandsitesisaboveagiventhreshold.Weemploytechniquesandmethodsfrom
computational geometrytodesignanoptimizationalgorithmandanefficient 12
-approximation algorithm
for theproblem,andemploytheoptimizationalgorithmtodesignaPTASbasedontheshiftingstrategy
[Hochbaum DS,MaassW.Approximationschemesforcoveringandpackingproblemsinimageprocessing
and VLSI.JournaloftheACM1985;32:130–6].Asabyproductweimprovethealgorithmforplacing
obnoxious facilitiesgivenbyKatzetal.[Improvedalgorithmsforplacingundesirablefacilities.Computers
& OperationsResearch2002;29:1859–72.].
Keywords
Abnoxious multifacility location , Approximate solution
Journal title
Computers and Operations Research
Serial Year
2010
Journal title
Computers and Operations Research
Record number
927632
Link To Document