Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem (Q1268250): Difference between revisions

@@ Property / cites work @@
+An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
+Normal rank
@@ Property / cites work @@
+Q5722776
@@ Property / cites work: Q5722776 / rank @@
+Normal rank
@@ Property / cites work @@
+Packing problems
@@ Property / cites work: Packing problems / rank @@
+Normal rank
@@ Property / cites work @@
+Jostling for position: local improvement for irregular cutting patterns
+Normal rank
@@ Property / cites work @@
+A typology of cutting and packing problems
@@ Property / cites work: A typology of cutting and packing problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4739659
@@ Property / cites work: Q4739659 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4163145
@@ Property / cites work: Q4163145 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3801335
@@ Property / cites work: Q3801335 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3670496
@@ Property / cites work: Q3670496 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4064616
@@ Property / cites work: Q4064616 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4518579
@@ Property / cites work: Q4518579 / rank @@
+Normal rank
@@ Property / cites work @@
+Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
+Normal rank
@@ Property / cites work @@
+Two-dimensional Cutting Stock with Multiple Stock Sizes
+Normal rank