An asymptotic fully polynomial time approximation scheme for bin covering. (Q1426473): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+On a dual version of the one-dimensional bin packing 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 @@
+Coordination Complexity of Parallel Price-Directive Decomposition
+Normal rank