Families of non-IRUP instances of the one-dimensional cutting stock problem (Q1613404): Difference between revisions

@@ Property / cites work @@
+Integer Rounding for Polymatroid and Branching Optimization Problems
+Normal rank
@@ Property / cites work @@
+Q4880190
@@ Property / cites work: Q4880190 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4398379
@@ Property / cites work: Q4398379 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4368542
@@ Property / cites work: Q4368542 / 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 @@
+Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
+Normal rank
@@ Property / cites work @@
+An instance of the cutting stock problem for which the rounding property does not hold
+Normal rank
@@ Property / cites work @@
+Q3993418
@@ Property / cites work: Q3993418 / rank @@
+Normal rank
@@ Property / cites work @@
+Tighter relaxations for the cutting stock problem
@@ Property / cites work: Tighter relaxations for the cutting stock problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4848284
@@ Property / cites work: Q4848284 / rank @@
+Normal rank
@@ Property / cites work @@
+The modified integer round-up property of the one-dimensional cutting stock problem
+Normal rank
@@ Property / cites work @@
+Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem
+Normal rank
@@ Property / cites work @@
+Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm
+Normal rank
@@ Property / cites work @@
+Computational study of a column generation algorithm for bin packing and cutting stock problems
+Normal rank
@@ Property / cites work @@
+Heuristics for the integer one-dimensional cutting stock problem: A computational study
+Normal rank