Solving nesting problems with non-convex polygons by constraint logic programming (Q4814103): Difference between revisions

@@ Property / describes a project that uses @@
+SICStus
@@ Property / describes a project that uses: SICStus / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1111/1475-3995.00434
+Normal rank
@@ Property / OpenAlex ID @@
+W2007670071
@@ Property / OpenAlex ID: W2007670071 / rank @@
+Normal rank
@@ Property / cites work @@
+A Solution of the Rectangular Cutting-Stock Problem
+Normal rank
@@ Property / cites work @@
+Packing problems
@@ Property / cites work: Packing problems / rank @@
+Normal rank
@@ Property / cites work @@
+Solution approaches to irregular nesting problems
@@ Property / cites work: Solution approaches to irregular nesting problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4254883
@@ Property / cites work: Q4254883 / rank @@
+Normal rank
@@ Property / cites work @@
+Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints
+Normal rank