A Polynomial Time Approximation Scheme for the Square Packing Problem (Q3503847): Difference between revisions

@@ Property / cites work @@
+Two-dimensional bin packing with one-dimensional resource augmentation
+Normal rank
@@ Property / cites work @@
+Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
+Normal rank
@@ Property / cites work @@
+An efficient approximation for the generalized assignment problem
+Normal rank
@@ Property / cites work @@
+Mathematical Foundations of Computer Science 2005
@@ Property / cites work: Mathematical Foundations of Computer Science 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the Orthogonal Knapsack Problem for Hypercubes
+Normal rank
@@ Property / cites work @@
+Maximizing the total profit of rectangles packed into a rectangle
+Normal rank
@@ Property / cites work @@
+A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for Knapsack Problems
+Normal rank
@@ Property / cites work @@
+Q4220418
@@ Property / cites work: Q4220418 / rank @@
+Normal rank