Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
From MaRDI portal
Publication:2384599
Recommendations
- Heurísticas para os problemas de geração e sequenciamento de padrões de corte bidimensionais
- Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study
- A new dynamic programming procedure for three-staged cutting patterns
- Fast heuristic for constrained homogenous T-shape cutting patterns
- Exact algorithms for large-scale unconstrained two and three staged cutting problems
- A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns
- Heuristic and exact methods for the cutting sequencing problem
- Reducing the number of cuts in generating three-staged cutting patterns
- An exact algorithm for generating homogeneous T-shape cutting patterns
Cites work
- A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
- An Algorithm for Two-Dimensional Cutting Problems
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- An improved typology of cutting and packing problems
- An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
- Approximate and exact algorithms for constrained (un)weighted two-dimensional two-staged cutting stock problems
- Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
- Dynamic programming algorithms for generating optimal strip layouts
- Efficient algorithm for the constrained two-dimensional cutting stock problem
- Exact algorithms for large-scale unconstrained two and three staged cutting problems
- Exact solutions for constrained two-dimensional cutting problems
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- Integer linear programming models for 2-staged two-dimensional knapsack problems
- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
Cited in
(20)- 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
- Heuristic and exact methods for the cutting sequencing problem
- A new dynamic programming procedure for three-staged cutting patterns
- An enumeration scheme to generate constrained exact checkerboard patterns
- An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem
- Sequential value correction heuristic for the two-dimensional cutting stock problem with three-staged homogenous patterns
- A block-based layer building approach for the 2D guillotine strip packing problem
- Heuristic for constrained T-shape cutting patterns of rectangular pieces
- 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
- Checkerboard pattern: proposals for its generation
- Exact algorithms for large-scale unconstrained two and three staged cutting problems
- Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry
- A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine 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 exact algorithm for generating homogeneous T-shape cutting patterns
- An integer programming model for two- and three-stage two-dimensional cutting stock problems
This page was built for publication: Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2384599)
