A mixed integer formulation for maximal covering by inclined parallelograms (Q1876161): Difference between revisions

@@ Property / cites work @@
+An extended continuous maximal covering location problem with facility placement
+Normal rank
@@ Property / cites work @@
+A single facility location problem with a weighted maximin-minimax rectilinear distance
+Normal rank
@@ Property / cites work @@
+Q3993417
@@ Property / cites work: Q3993417 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4203976
@@ Property / cites work: Q4203976 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for computerized inspection of rectangular and square shapes
+Normal rank
@@ Property / cites work @@
+Covering a set of points by two axis-parallel boxes
+Normal rank
@@ Property / cites work @@
+Q4229625
@@ Property / cites work: Q4229625 / rank @@
+Normal rank
@@ Property / cites work @@
+Translating a convex polygon to contain a maximum number of points.
+Normal rank
@@ Property / cites work @@
+Optimal placement of convex polygons to maximize point containment
+Normal rank
@@ Property / cites work @@
+Optimal packing and covering in the plane are NP-complete
+Normal rank