Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming (Q819074): Difference between revisions

@@ Property / cites work @@
+A tabu thresholding implementation for the irregular stock cutting problem
+Normal rank
@@ Property / cites work @@
+The irregular cutting-stock problem -- a new procedure for deriving the no-fit polygon.
+Normal rank
@@ Property / cites work @@
+A local search approach for two-dimensional irregular cutting
+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 @@
+Jostling for position: local improvement for irregular cutting patterns
+Normal rank
@@ Property / cites work @@
+A 2-exchange heuristic for nesting problems
@@ Property / cites work: A 2-exchange heuristic for nesting problems / rank @@
+Normal rank
@@ Property / cites work @@
+A simulated annealing approach to the nesting problem in the textile manufacturing industry
+Normal rank
@@ Property / cites work @@
+A hybrid algorithm for the two-dimensional layout problem: the cases of regular and irregular shapes
+Normal rank
@@ Property / cites work @@
+Optimization by Simulated Annealing
@@ Property / cites work: Optimization by Simulated Annealing / rank @@
+Normal rank
@@ Property / cites work @@
+Compaction and separation algorithms for non-convex polygons and their applications
+Normal rank
@@ Property / cites work @@
+Equation of State Calculations by Fast Computing Machines
+Normal rank
@@ Property / cites work @@
+TOPOS -- A new constructive algorithm for nesting problems
+Normal rank
@@ Property / cites work @@
+Applied simulated annealing
@@ Property / cites work: Applied simulated annealing / rank @@
+Normal rank
@@ Property / cites work @@
+General local search methods
@@ Property / cites work: General local search methods / rank @@
+Normal rank
@@ Property / cites work @@
+Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem
+Normal rank