The maximum resource bin packing problem (Q2508970): Difference between revisions

@@ Property / cites work @@
+The lazy bureaucrat scheduling problem
@@ Property / cites work: The lazy bureaucrat scheduling problem / rank @@
+Normal rank
@@ Property / cites work @@
+On a dual version of the one-dimensional bin packing problem
+Normal rank
@@ Property / cites work @@
+Q5501263
@@ Property / cites work: Q5501263 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4223058
@@ Property / cites work: Q4223058 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4437497
@@ Property / cites work: Q4437497 / rank @@
+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 @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds for Certain Multiprocessing Anomalies
@@ Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank @@
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for the maximum traveling salesman problem
+Normal rank
@@ Property / cites work @@
+An asymptotic fully polynomial time approximation scheme for bin covering.
+Normal rank
@@ Property / cites work @@
+Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
+Normal rank
@@ Property / cites work @@
+On approximating the longest path in a graph
@@ Property / cites work: On approximating the longest path in a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Competitive snoopy caching
@@ Property / cites work: Competitive snoopy caching / rank @@
+Normal rank