The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming (Q1296373): Difference between revisions

@@ Property / cites work @@
+Q3347319
@@ Property / cites work: Q3347319 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast algorithms for bin packing
@@ Property / cites work: Fast algorithms for bin packing / rank @@
+Normal rank
@@ Property / cites work @@
+Packing problems
@@ Property / cites work: Packing problems / rank @@
+Normal rank
@@ Property / cites work @@
+A New Linear Programming Approach to the Cutting Stock Problem
+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 @@
+A Linear Programming Approach to the Cutting-Stock Problem
+Normal rank