An asymptotically exact algorithm for the high-multiplicity bin packing problem (Q2570998): Difference between revisions

@@ Property / cites work @@
+Q5501355
@@ Property / cites work: Q5501355 / rank @@
+Normal rank
@@ Property / cites work @@
+Integer Rounding for Polymatroid and Branching Optimization Problems
+Normal rank
@@ Property / cites work @@
+Algorithms - ESA 2003
@@ Property / cites work: Algorithms - ESA 2003 / rank @@
+Normal rank
@@ Property / cites work @@
+An application of simultaneous diophantine approximation in combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Geometric algorithms and combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Computing Two-Dimensional Integer Hulls
@@ Property / cites work: Computing Two-Dimensional Integer Hulls / rank @@
+Normal rank
@@ Property / cites work @@
+Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
+Normal rank
@@ Property / cites work @@
+The Linear Diophantine Equation
@@ Property / cites work: The Linear Diophantine Equation / rank @@
+Normal rank
@@ Property / cites work @@
+On Scheduling Independent Tasks with Restricted Execution Times
+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 @@
+A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths
+Normal rank
@@ Property / cites work @@
+Families of non-IRUP instances of the one-dimensional cutting stock problem
+Normal rank
@@ Property / cites work @@
+Q3818127
@@ Property / cites work: Q3818127 / rank @@
+Normal rank