An approximation scheme for the two-stage, two-dimensional knapsack problem (Q429647): Difference between revisions

@@ Property / cites work @@
+Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing
+Normal rank
@@ Property / cites work @@
+A Strip-Packing Algorithm with Absolute Performance Bound 2
+Normal rank
@@ Property / cites work @@
+On the two-dimensional knapsack problem
@@ Property / cites work: On the two-dimensional knapsack problem / rank @@
+Normal rank
@@ Property / cites work @@
+Maximizing the total profit of rectangles packed into a rectangle
+Normal rank
@@ Property / cites work @@
+A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability
+Normal rank
@@ Property / cites work @@
+The Multiple Subset Sum Problem
@@ Property / cites work: The Multiple Subset Sum Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4258216
@@ Property / cites work: Q4258216 / rank @@
+Normal rank
@@ Property / cites work @@
+Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
+Normal rank
@@ Property / cites work @@
+Bin packing can be solved within 1+epsilon in linear time
+Normal rank
@@ Property / cites work @@
+Integer Programming with a Fixed Number of Variables
+Normal rank
@@ Property / cites work @@
+Q4821303
@@ Property / cites work: Q4821303 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
+Normal rank