Online LIB problems: Heuristics for Bin Covering and lower bounds for Bin Packing (Q5479859): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2026961896
@@ Property / OpenAlex ID: W2026961896 / rank @@
+Normal rank
@@ Property / cites work @@
+On a dual version of the one-dimensional bin packing problem
+Normal rank
@@ Property / cites work @@
+Bin covering algorithms in the second stage of the lot to order matching problem
+Normal rank
@@ Property / cites work @@
+Q2707233
@@ Property / cites work: Q2707233 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2768348
@@ Property / cites work: Q2768348 / rank @@
+Normal rank
@@ Property / cites work @@
+On the sum-of-squares algorithm for bin packing
@@ Property / cites work: On the sum-of-squares algorithm for bin packing / rank @@
+Normal rank
@@ Property / cites work @@
+Online algorithms for a dual version of bin packing
+Normal rank
@@ Property / cites work @@
+A simple on-line bin-packing algorithm
@@ Property / cites work: A simple on-line bin-packing algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Q4552137
@@ Property / cites work: Q4552137 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4820876
@@ Property / cites work: Q4820876 / rank @@
+Normal rank
@@ Property / cites work @@
+An improved lower bound for on-line bin packing algorithms
+Normal rank
@@ Property / cites work @@
+Optimal on-line algorithms for variable-sized bin covering
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5479859