Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
From MaRDI portal
Publication:2384599
DOI10.1016/j.cor.2006.02.029zbMath1149.90428OpenAlexW2078953182MaRDI QIDQ2384599
Publication date: 10 October 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2006.02.029
Related Items (14)
A block-based layer building approach for the 2D guillotine strip packing problem ⋮ Heuristic for constrained T-shape cutting patterns of rectangular pieces ⋮ An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem ⋮ A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem ⋮ Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry ⋮ Reducing the number of cuts in generating three-staged cutting patterns ⋮ Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem ⋮ A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns ⋮ Fast heuristic for constrained homogenous T-shape cutting patterns ⋮ An integer programming model for two- and three-stage two-dimensional cutting stock problems ⋮ Sequential value correction heuristic for the two-dimensional cutting stock problem with three-staged homogenous patterns ⋮ A recursive algorithm for constrained two-dimensional cutting problems ⋮ A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting ⋮ New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
Cites Work
- Unnamed Item
- Exact solutions for constrained two-dimensional cutting problems
- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
- An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- Integer linear programming models for 2-staged two-dimensional knapsack problems
- Dynamic programming algorithms for generating optimal strip layouts
- An improved typology of cutting and packing problems
- Efficient Algorithm for the Constrained Two‐dimensional Cutting Stock Problem
- A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- An Algorithm for Two-Dimensional Cutting Problems
- Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
- Exact algorithms for large-scale unconstrained two and three staged cutting problems
- Approximate and exact algorithms for constrained (un)weighted two-dimensional two-staged cutting stock problems
This page was built for publication: Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
