Probabilistic analysis for simple one- and two-dimensional bin packing algorithms (Q1149248): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(80)90041-1
+Normal rank
@@ Property / OpenAlex ID @@
+W1981738785
@@ Property / OpenAlex ID: W1981738785 / rank @@
+Normal rank
@@ Property / cites work @@
+Orthogonal Packings in Two Dimensions
@@ Property / cites work: Orthogonal Packings in Two Dimensions / rank @@
+Normal rank
@@ Property / cites work @@
+A stochastic model of bin-packing
@@ Property / cites work: A stochastic model of bin-packing / rank @@
+Normal rank
@@ Property / cites work @@
+Q5629053
@@ Property / cites work: Q5629053 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5538132
@@ Property / cites work: Q5538132 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4161330
@@ Property / cites work: Q4161330 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Two-dimensional packing: expected performance of simple level algorithms
+Normal rank
@@ Property / cites work @@
+Fast algorithms for bin packing
@@ Property / cites work: Fast algorithms for bin packing / rank @@
+Normal rank
@@ Property / cites work @@
+Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
+Normal rank
@@ Property / cites work @@
+Q4138133
@@ Property / cites work: Q4138133 / rank @@
+Normal rank
@@ Property / cites work @@
+New Algorithms for Bin Packing
@@ Property / cites work: New Algorithms for Bin Packing / rank @@
+Normal rank