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

@@ Property / author @@
-Jean Marie Proth
@@ Property / author: Jean Marie Proth / rank @@
-Normal rank
@@ Property / author @@
+Jean Marie Proth
@@ Property / author: Jean Marie Proth / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q57186020
@@ Property / Wikidata QID: Q57186020 / rank @@
+Normal rank
@@ 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
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0377-2217(98)00163-5
+Normal rank
@@ Property / OpenAlex ID @@
+W1967335485
@@ Property / OpenAlex ID: W1967335485 / rank @@
+Normal rank