Generating optimal two-section cutting patterns for rectangular blanks
From MaRDI portal
Publication:2581593
Recommendations
- Generating optimal cutting patterns for rectangular blanks of a single size
- Generating optimal T-shape cutting patterns for circular blanks
- Generating optimal multi-segment cutting patterns for circular blanks in the manufacturing of electric motors
- An algorithm for the determination of optimal cutting patterns
- A research on the algorithms for generating optimal two-segment cutting patterns with cuts number consideration
- Two-stage general block patterns for the two-dimensional cutting problem
- Heurísticas para os problemas de geração e sequenciamento de padrões de corte bidimensionais
- Exact algorithm for generating two-segment cutting patterns of punched strips
- On the \(L\)-approach for generating unconstrained two-dimensional non-guillotine cutting patterns
- Simplest optimal cutting patterns for equal rectangles
Cites work
- A new upper bound for unconstrained two-dimensional cutting and packing
- A recursive exact algorithm for weighted two-dimensional cutting
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An Algorithm for Two-Dimensional Cutting Problems
- An approximation algorithm for solving unconstrained two-dimensional knapsack problems
- Exact algorithms for large-scale unconstrained two and three staged cutting problems
- LP models for bin packing and cutting stock problems
- Multistage Cutting Stock Problems of Two and More Dimensions
- Recursive Computational Procedure for Two-dimensional Stock Cutting
- The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems
- The Theory and Computation of Knapsack Functions
- Unbounded knapsack problem: Dynamic programming revisited
Cited in
(22)- A cutting stock problem and its solution in the manufacturing industry of large electric generators
- Selection of stockplate characteristics and cutting style for two dimensional cutting stock situations
- Generating optimal T-shape cutting patterns for circular blanks
- An enumeration scheme to generate constrained exact checkerboard patterns
- Simple block patterns for the two-dimensional cutting problem
- Dynamic programming algorithms for the optimal cutting of equal rectangles
- Dynamic programming algorithms for generating optimal strip layouts
- A simple algorithm for generating optimal equal circle cutting patterns with minimum sections
- Uniform block patterns for constrained guillotine cutting of rectangular items
- scientific article; zbMATH DE number 4165901 (Why is no real title available?)
- An algorithm for the two-dimensional cutting-stock problem based on a pattern generation procedure
- Nonorthogonal Two-Dimensional Cutting Patterns
- scientific article; zbMATH DE number 166938 (Why is no real title available?)
- Generating optimal cutting patterns for rectangular blanks of a single size
- A research on the algorithms for generating optimal two-segment cutting patterns with cuts number consideration
- Introducing Cutting Patterns in Form Finding and Structural Analysis
- A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns
- Minimizing trim loss in cutting rectangular blanks of a single size from a rectangular sheet using orthogonal guillotine cuts
- Exact algorithm for generating two-segment cutting patterns of punched strips
- An exact algorithm for generating homogeneous T-shape cutting patterns
- Two-stage general block patterns for the two-dimensional cutting problem
- T-shape homogeneous block patterns for the two-dimensional cutting problem
This page was built for publication: Generating optimal two-section cutting patterns for rectangular blanks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2581593)
