A new lower bound for the non-oriented two-dimensional bin-packing problem (Q2467479): Difference between revisions

@@ Property / cites work @@
+Two-Dimensional Finite Bin-Packing Algorithms
@@ Property / cites work: Two-Dimensional Finite Bin-Packing Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case
+Normal rank
@@ Property / cites work @@
+The two-dimensional finite bin packing problem. II: New lower and upper bounds
+Normal rank
@@ Property / cites work @@
+Bidimensional Packing by Bilinear Programming
@@ Property / cites work: Bidimensional Packing by Bilinear Programming / rank @@
+Normal rank
@@ Property / cites work @@
+New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
+Normal rank
@@ Property / cites work @@
+A lower bound for the non-oriented two-dimensional bin packing problem
+Normal rank
@@ Property / cites work @@
+A general framework for bounds for higher-dimensional orthogonal packing problems.
+Normal rank
@@ Property / cites work @@
+Exact Solution of the Two-Dimensional Finite Bin Packing Problem
+Normal rank
@@ Property / cites work @@
+An improved typology of cutting and packing problems
+Normal rank