Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem (Q1376328): Difference between revisions

@@ Property / cites work @@
+Integer Rounding for Polymatroid and Branching Optimization Problems
+Normal rank
@@ Property / cites work @@
+Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
+Normal rank
@@ Property / cites work @@
+A Linear Programming Approach to the Cutting-Stock Problem
+Normal rank
@@ Property / cites work @@
+Q4726042
@@ Property / cites work: Q4726042 / rank @@
+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 @@
+An instance of the cutting stock problem for which the rounding property does not hold
+Normal rank
@@ Property / cites work @@
+Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
+Normal rank
@@ Property / cites work @@
+Q3989344
@@ Property / cites work: Q3989344 / rank @@
+Normal rank
@@ Property / cites work @@
+Modeling of packing problems
@@ Property / cites work: Modeling of packing problems / rank @@
+Normal rank
@@ Property / cites work @@
+The modified integer round-up property of the one-dimensional cutting stock problem
+Normal rank
@@ Property / cites work @@
+Q3805803
@@ Property / cites work: Q3805803 / rank @@
+Normal rank
@@ Property / cites work @@
+CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
+Normal rank