An improved approximation scheme for variable-sized bin packing (Q504994): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00224-015-9644-2
+Normal rank
@@ Property / OpenAlex ID @@
+W2237348435
@@ Property / OpenAlex ID: W2237348435 / rank @@
+Normal rank
@@ Property / cites work @@
+Using fast matrix multiplication to find basic solutions
+Normal rank
@@ Property / cites work @@
+Q3241581
@@ Property / cites work: Q3241581 / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear Programming Approach to the Cutting Stock Problem—Part II
+Normal rank
@@ Property / cites work @@
+The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9
+Normal rank
@@ Property / cites work @@
+The Trim Problem
@@ Property / cites work: The Trim Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Class constrained bin packing revisited
@@ Property / cites work: Class constrained bin packing revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Bin packing can be solved within 1+epsilon in linear time
+Normal rank
@@ Property / cites work @@
+Variable Sized Bin Packing
@@ Property / cites work: Variable Sized Bin Packing / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear Programming Approach to the Cutting-Stock Problem
+Normal rank
@@ Property / cites work @@
+Approximate Max-Min Resource Sharing for Structured Concave Optimization
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Min-Max and Max-Min Resource Sharing Problems, and Applications
+Normal rank
@@ Property / cites work @@
+An Improved Approximation Scheme for Variable-Sized Bin Packing
+Normal rank
@@ Property / cites work @@
+An Improved Knapsack Solver for Column Generation
@@ Property / cites work: An Improved Knapsack Solver for Column Generation / rank @@
+Normal rank
@@ Property / cites work @@
+An asymptotic fully polynomial time approximation scheme for bin covering.
+Normal rank
@@ Property / cites work @@
+Mathematical Methods of Organizing and Planning Production
+Normal rank
@@ Property / cites work @@
+Q4821303
@@ Property / cites work: Q4821303 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for Knapsack Problems
+Normal rank
@@ Property / cites work @@
+A fully polynomial approximation algorithm for the 0-1 knapsack problem
+Normal rank
@@ Property / cites work @@
+An Efficient Approximation Scheme for Variable-Sized Bin Packing
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for Fractional Packing and Covering Problems
+Normal rank
@@ Property / cites work @@
+Approximation schemes for packing with item fragmentation
+Normal rank
@@ Property / cites work @@
+Fast Asymptotic FPTAS for Packing Fragmentable Items with Costs
+Normal rank
@@ Property / cites work @@
+Q3575206
@@ Property / cites work: Q3575206 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4290987
@@ Property / cites work: Q4290987 / rank @@
+Normal rank