Optimization of 3D objects layout into a multiply connected domain with account for shortest distances (Q2263288): Difference between revisions

@@ Property / DOI @@
-.1007/s10559-014-9626-4
@@ Property / DOI: 10.1007/s10559-014-9626-4 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10559-014-9626-4
+Normal rank
@@ Property / OpenAlex ID @@
+W2092915069
@@ Property / OpenAlex ID: W2092915069 / rank @@
+Normal rank
@@ Property / cites work @@
+MIP-based heuristic for non-standard 3D-packing problems
+Normal rank
@@ Property / cites work @@
+Q2768883
@@ Property / cites work: Q2768883 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2850190
@@ Property / cites work: Q2850190 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2850133
@@ Property / cites work: Q2850133 / rank @@
+Normal rank
@@ Property / cites work @@
+Linearization method for inverse convex programming
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+Normal rank
@@ Property / cites work @@
+Packing unequal circles into a strip of minimal length with a jump algorithm
+Normal rank
@@ Property / DOI @@
+.1007/S10559-014-9626-4
@@ Property / DOI: 10.1007/S10559-014-9626-4 / rank @@
+Normal rank