On genetic algorithms for the packing of polygons (Q1266576): Difference between revisions

@@ Property / cites work @@
+Orthogonal Packings in Two Dimensions
@@ Property / cites work: Orthogonal Packings in Two Dimensions / rank @@
+Normal rank
@@ Property / cites work @@
+An improved BL lower bound
@@ Property / cites work: An improved BL lower bound / rank @@
+Normal rank
@@ Property / cites work @@
+Q3347319
@@ Property / cites work: Q3347319 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5527536
@@ Property / cites work: Q5527536 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal packing and covering in the plane are NP-complete
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4692508
@@ Property / cites work: Q4692508 / rank @@
+Normal rank
@@ Property / cites work @@
+A Multistage Solution of the Template-Layout Problem
+Normal rank
@@ Property / cites work @@
+Q4079017
@@ Property / cites work: Q4079017 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4023071
@@ Property / cites work: Q4023071 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4117322
@@ Property / cites work: Q4117322 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3897937
@@ Property / cites work: Q3897937 / rank @@
+Normal rank
@@ Property / cites work @@
+A 2.5 times optimal algorithm for packing in two dimensions
+Normal rank
@@ Property / cites work @@
+Q3805803
@@ Property / cites work: Q3805803 / rank @@
+Normal rank