A method for optimising the nesting of multiple, highly complex shapes using a modified simulated annealing algorithm (Q3626898): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1080/00207720802630651
+Normal rank
@@ Property / OpenAlex ID @@
+W2037518929
@@ Property / OpenAlex ID: W2037518929 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization by Simulated Annealing
@@ Property / cites work: Optimization by Simulated Annealing / rank @@
+Normal rank
@@ Property / cites work @@
+A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem.
+Normal rank
@@ Property / cites work @@
+Packing problems
@@ Property / cites work: Packing problems / rank @@
+Normal rank
@@ Property / cites work @@
+Some experiments with simulated annealing techniques for packing problems
+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 @@
+New approaches for the nesting of two-dimensional shapes for press tool design
+Normal rank