A new dynamic programming procedure for three-staged cutting patterns
From MaRDI portal
Publication:1941034
DOI10.1007/s10898-012-9930-3zbMath1268.90061OpenAlexW2070202675MaRDI QIDQ1941034
Publication date: 11 March 2013
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-012-9930-3
Related Items (2)
An effective heuristic based on column generation for the two-dimensional three-stage steel plate cutting problem ⋮ Two-stage two-dimensional guillotine cutting stock problems with usable leftover
Cites Work
- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
- An improved typology of cutting and packing problems
- A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
- 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
This page was built for publication: A new dynamic programming procedure for three-staged cutting patterns
