Integer linear programming for a cutting problem in the wood-processing industry: a case study (Q3401328): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1111/j.1475-3995.2009.00704.x
+Normal rank
@@ Property / OpenAlex ID @@
+W2027991349
@@ Property / OpenAlex ID: W2027991349 / rank @@
+Normal rank
@@ Property / cites work @@
+The one-dimensional cutting stock problem with usable leftover - a heuristic approach
+Normal rank
@@ Property / cites work @@
+A typology of cutting and packing problems
@@ Property / cites work: A typology of cutting and packing problems / rank @@
+Normal rank
@@ Property / cites work @@
+The Trim Problem
@@ Property / cites work: The Trim Problem / rank @@
+Normal rank
@@ Property / cites work @@
+A note on handling residual lengths
@@ Property / cites work: A note on handling residual lengths / rank @@
+Normal rank
@@ Property / cites work @@
+One-dimensional cutting stock optimization in consecutive time periods
+Normal rank
@@ Property / cites work @@
+An improved typology of cutting and packing problems
+Normal rank