Solving the 3-staged 2-dimensional cutting stock problem by dynamic programming and variable neighborhood search (Q2631244): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.endm.2014.11.018
+Normal rank
@@ Property / OpenAlex ID @@
+W1993974091
@@ Property / OpenAlex ID: W1993974091 / rank @@
+Normal rank
@@ Property / cites work @@
+Two-Dimensional Finite Bin-Packing Algorithms
@@ Property / cites work: Two-Dimensional Finite Bin-Packing Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
+Normal rank
@@ Property / cites work @@
+Multistage Cutting Stock Problems of Two and More Dimensions
+Normal rank
@@ Property / cites work @@
+Recursive Computational Procedure for Two-dimensional Stock Cutting
+Normal rank
@@ Property / cites work @@
+Recent advances on two-dimensional bin packing problems
+Normal rank
@@ Property / cites work @@
+Exact Solution of the Two-Dimensional Finite Bin Packing Problem
+Normal rank
@@ Property / cites work @@
+A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem
+Normal rank
@@ Property / cites work @@
+Models and algorithms for three-stage two-dimensional bin packing
+Normal rank