A note on the approximability of cutting stock problems (Q2643962): Difference between revisions

@@ Property / cites work @@
+On Packing Two-Dimensional Bins
@@ Property / cites work: On Packing Two-Dimensional Bins / rank @@
+Normal rank
@@ Property / cites work @@
+Q3347319
@@ Property / cites work: Q3347319 / rank @@
+Normal rank
@@ Property / cites work @@
+An on-line algorithm for multidimensional bin packing
+Normal rank
@@ Property / cites work @@
+Bin packing can be solved within 1+epsilon in linear time
+Normal rank
@@ Property / cites work @@
+Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem
+Normal rank
@@ Property / cites work @@
+A Linear Programming Approach to the Cutting-Stock Problem
+Normal rank
@@ Property / cites work @@
+A Linear Programming Approach to the Cutting Stock Problem—Part II
+Normal rank
@@ Property / cites work @@
+Multistage Cutting Stock Problems of Two and More Dimensions
+Normal rank
@@ Property / cites work @@
+The modified integer round-up property of the one-dimensional cutting stock problem
+Normal rank
@@ Property / cites work @@
+Branch-and-price algorithms for the one-dimensional cutting stock problem
+Normal rank
@@ Property / cites work @@
+Computational study of a column generation algorithm for bin packing and cutting stock problems
+Normal rank
@@ Property / cites work @@
+An LP-based approach to cutting stock problems with multiple objectives
+Normal rank
@@ Property / cites work @@
+An improved typology of cutting and packing problems
+Normal rank