Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study (Q1433163): Difference between revisions

@@ Property / cites work @@
+A comparative evaluation of heuristics for container loading
+Normal rank
@@ Property / cites work @@
+Multistage Cutting Stock Problems of Two and More Dimensions
+Normal rank
@@ Property / cites work @@
+Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
+Normal rank
@@ Property / cites work @@
+The Theory and Computation of Knapsack Functions
@@ Property / cites work: The Theory and Computation of Knapsack Functions / rank @@
+Normal rank
@@ Property / cites work @@
+Recursive Computational Procedure for Two-dimensional Stock Cutting
+Normal rank
@@ Property / cites work @@
+Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems
+Normal rank
@@ Property / cites work @@
+A recursive exact algorithm for weighted two-dimensional cutting
+Normal rank
@@ Property / cites work @@
+A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
+Normal rank
@@ Property / cites work @@
+The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems
+Normal rank
@@ Property / cites work @@
+An and-or-graph approach for two-dimensional cutting problems
+Normal rank
@@ Property / cites work @@
+Dynamic, first-fit packings in two or more dimensions
+Normal rank
@@ Property / cites work @@
+Load planning for shipments of low density products
+Normal rank
@@ Property / cites work @@
+Approximate algorithms for the container loading problem
+Normal rank
@@ Property / cites work @@
+Q3354824
@@ Property / cites work: Q3354824 / rank @@
+Normal rank
@@ Property / cites work @@
+An Algorithm for Two-Dimensional Cutting Problems
@@ Property / cites work: An Algorithm for Two-Dimensional Cutting Problems / rank @@
+Normal rank
@@ Property / cites work @@
+A Minimal Algorithm for the 0-1 Knapsack Problem
@@ Property / cites work: A Minimal Algorithm for the 0-1 Knapsack Problem / rank @@
+Normal rank