On the bin packing problem with a fixed number of object weights (Q872247): Difference between revisions

@@ Property / cites work @@
+Worst-case analyses, linear programming and the bin-packing problem
+Normal rank
@@ Property / cites work @@
+Algorithms - ESA 2003
@@ Property / cites work: Algorithms - ESA 2003 / rank @@
+Normal rank
@@ Property / cites work @@
+Carathéodory bounds for integer cones
@@ Property / cites work: Carathéodory bounds for integer cones / rank @@
+Normal rank
@@ Property / cites work @@
+Ranking lower bounds for the bin-packing problem
@@ Property / cites work: Ranking lower bounds for the bin-packing problem / rank @@
+Normal rank
@@ Property / cites work @@
+An asymptotically exact algorithm for the high-multiplicity bin packing problem
+Normal rank
@@ Property / cites work @@
+Geometric algorithms and combinatorial optimization
+Normal rank
@@ Property / cites work @@
+The cutting stock problem and integer rounding
@@ Property / cites work: The cutting stock problem and integer rounding / rank @@
+Normal rank
@@ Property / cites work @@
+Exploiting orbits in symmetric ILP
@@ Property / cites work: Exploiting orbits in symmetric ILP / rank @@
+Normal rank
@@ Property / cites work @@
+A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths
+Normal rank
@@ Property / cites work @@
+New cases of the cutting stock problem having MIRUP
+Normal rank
@@ Property / cites work @@
+Families of non-IRUP instances of the one-dimensional cutting stock problem
+Normal rank
@@ Property / cites work @@
+Q4848284
@@ Property / cites work: Q4848284 / rank @@
+Normal rank
@@ Property / cites work @@
+Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem
+Normal rank