Exact algorithm for generating two-segment cutting patterns of punched strips
From MaRDI portal
Publication:837733
DOI10.1016/J.APM.2006.06.010zbMATH Open1167.90625OpenAlexW2011126322MaRDI QIDQ837733FDOQ837733
Authors: Yaodong Cui 
Publication date: 21 August 2009
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2006.06.010
Recommendations
- Recursive algorithm for the two‐dimensional cutting problem of punched strips
- An exact algorithm for generating homogeneous T-shape cutting patterns
- An algorithm for the determination of optimal cutting patterns
- Strip generation algorithms for constrained two-dimensional two-staged cutting problems
- A research on the algorithms for generating optimal two-segment cutting patterns with cuts number consideration
- An algorithm for the two-dimensional cutting-stock problem based on a pattern generation procedure
- Heurísticas para os problemas de geração e sequenciamento de padrões de corte bidimensionais
- Generating optimal two-section cutting patterns for rectangular blanks
- An exact rectangular two-segment layout algorithm with optimal same-shape strip generation
- A simple algorithm for generating optimal equal circle cutting patterns with minimum sections
Cites Work
- Title not available (Why is that?)
- Multistage Cutting Stock Problems of Two and More Dimensions
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
- A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems.
- An efficient approach for large-scale two-dimensional guillotine cutting stock problems
- Exact algorithms for large-scale unconstrained two and three staged cutting problems
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
- Two-stage general block patterns for the two-dimensional cutting problem
- Generating optimal T-shape cutting patterns for circular blanks
- Practical adaptations of the Gilmore-Gomory approach to cutting stock problems
Cited In (6)
- Generating optimal two-section cutting patterns for rectangular blanks
- A research on the algorithms for generating optimal two-segment cutting patterns with cuts number consideration
- The cutting stock problem applied to the hardening process in an automotive spring factory
- Dynamic programming algorithms for generating optimal strip layouts
- Deterministic model for customized pilot manufacture production with various backplane sizes
- Recursive algorithm for the two‐dimensional cutting problem of punched strips
Uses Software
This page was built for publication: Exact algorithm for generating two-segment cutting patterns of punched strips
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q837733)
