Exact algorithm for generating two-segment cutting patterns of punched strips
From MaRDI portal
Publication:837733
DOI10.1016/j.apm.2006.06.010zbMath1167.90625OpenAlexW2011126322MaRDI QIDQ837733
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
Related Items (2)
The cutting stock problem applied to the hardening process in an automotive spring factory ⋮ Deterministic model for customized pilot manufacture production with various backplane sizes
Uses Software
Cites Work
- Unnamed Item
- Two-stage general block patterns for the two-dimensional cutting problem
- Practical adaptations of the Gilmore-Gomory approach to cutting stock problems
- 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.
- Generating optimal T-shape cutting patterns for circular blanks
- An efficient approach for large-scale two-dimensional guillotine cutting stock problems
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- Multistage Cutting Stock Problems of Two and More Dimensions
- 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
This page was built for publication: Exact algorithm for generating two-segment cutting patterns of punched strips
