Algorithms for the variable sized bin packing problem (Q1869719): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q3347319
@@ Property / cites work: Q3347319 / rank @@
+Normal rank
@@ Property / cites work @@
+Bin packing with divisible item sizes
@@ Property / cites work: Bin packing with divisible item sizes / rank @@
+Normal rank
@@ Property / cites work @@
+Variable Sized Bin Packing
@@ Property / cites work: Variable Sized Bin Packing / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear Programming Approach to the Cutting-Stock Problem
+Normal rank
@@ Property / cites work @@
+Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
+Normal rank
@@ Property / cites work @@
+An Efficient Approximation Scheme for Variable-Sized Bin Packing
+Normal rank
@@ Property / cites work @@
+Branch-and-price algorithms for the one-dimensional cutting stock problem
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1869719