Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms (Q1332349): Difference between revisions

@@ Property / author @@
-Gábor Galambos
@@ Property / author: Gábor Galambos / rank @@
-Normal rank
@@ Property / author @@
-André van Vliet
@@ Property / author: André van Vliet / rank @@
-Normal rank
@@ Property / author @@
+Gábor Galambos
@@ Property / author: Gábor Galambos / rank @@
+Normal rank
@@ Property / author @@
+André van Vliet
@@ Property / author: André van Vliet / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+An on-line algorithm for multidimensional bin packing
+Normal rank
@@ Property / cites work @@
+Q3988808
@@ Property / cites work: Q3988808 / rank @@
+Normal rank
@@ Property / cites work @@
+A simple proof of Liang's lower bound for on-line bin packing and the extension to the parametric case
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+A lower bound for on-line bin packing
@@ Property / cites work: A lower bound for on-line bin packing / rank @@
+Normal rank
@@ Property / cites work @@
+An improved lower bound for on-line bin packing algorithms
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf02246509
+Normal rank
@@ Property / OpenAlex ID @@
+W1580752931
@@ Property / OpenAlex ID: W1580752931 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1332349