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

@@ Property / Wikidata QID @@
+Q59222293
@@ Property / Wikidata QID: Q59222293 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle
+Normal rank
@@ Property / cites work @@
+Packing problems
@@ Property / cites work: Packing problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4382664
@@ Property / cites work: Q4382664 / rank @@
+Normal rank
@@ Property / cites work @@
+A Search-Based Heuristic For The Two-Dimensional Bin-Packing Problem
+Normal rank
@@ Property / cites work @@
+Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
+Normal rank
@@ Property / cites work @@
+The Three-Dimensional Bin Packing Problem
@@ Property / cites work: The Three-Dimensional Bin Packing Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Exact Solution of the Two-Dimensional Finite Bin Packing Problem
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0166-218x(01)00253-0
+Normal rank
@@ Property / OpenAlex ID @@
+W1997445317
@@ Property / OpenAlex ID: W1997445317 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1348248