Maximizing the number of obnoxious facilities to locate within a bounded region (Q733537): Difference between revisions

@@ Property / DOI @@
-.1016/j.cor.2009.04.004
@@ Property / DOI: 10.1016/j.cor.2009.04.004 / rank @@
-Normal rank
@@ Property / cites work @@
+Approximation of geometric dispersion problems
@@ Property / cites work: Approximation of geometric dispersion problems / rank @@
+Normal rank
@@ Property / cites work @@
+OBNOXIOUS FACILITY LOCATION: COMPLETE SERVICE WITH MINIMAL HARM
+Normal rank
@@ Property / cites work @@
+Q4229622
@@ Property / cites work: Q4229622 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal packing and covering in the plane are NP-complete
+Normal rank
@@ Property / cites work @@
+Approximation schemes for covering and packing problems in image processing and VLSI
+Normal rank
@@ Property / cites work @@
+Improved algorithms for placing undesirable facilities
+Normal rank
@@ Property / cites work @@
+Dynamic fractional cascading
@@ Property / cites work: Dynamic fractional cascading / rank @@
+Normal rank
@@ Property / cites work @@
+Q3992847
@@ Property / cites work: Q3992847 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2766841
@@ Property / cites work: Q2766841 / rank @@
+Normal rank
@@ Property / cites work @@
+Locating two obnoxious facilities using the weighted maximin criterion
+Normal rank
@@ Property / cites work @@
+The multifacility maximin planar location problem with facility interaction
+Normal rank
@@ Property / DOI @@
+.1016/J.COR.2009.04.004
@@ Property / DOI: 10.1016/J.COR.2009.04.004 / rank @@
+Normal rank