A new dynamic programming procedure for three-staged cutting patterns
type: Item
instance of: scholarly article
title: A new dynamic programming procedure for three-staged cutting patterns
zbMATH Open document ID: 1268.90061
author: Yaodong Cui
published in: Journal of Global Optimization
publication date: 2013-03-11T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6143167
zbMATH Keywords: cutting stock
zbMATH Keywords: two-dimensional cutting
zbMATH Keywords: three-staged patterns
zbMATH Keywords: knapsack problems
MaRDI profile type: Publication
full work available at URL: s10898-012-9930-3
OpenAlex ID: W2070202675
cites work: An improved typology of cutting and packing problems
cites work: Multistage Cutting Stock Problems of Two and More Dimensions
cites work: Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
cites work: Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
cites work: Exact algorithms for large-scale unconstrained two and three staged cutting problems
cites work: An efficient approach for large-scale two-dimensional guillotine cutting stock problems
cites work: A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
DOI: 10.1007/S10898-012-9930-3
Recommended article: Reducing the number of cuts in generating three-staged cutting patterns
Recommended article: Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
Recommended article: An algorithm for the determination of optimal cutting patterns
Recommended article: Solving the 3-staged 2-dimensional cutting stock problem by dynamic programming and variable neighborhood search
Recommended article: Q5260680
Recommended article: An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts
Recommended article: An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems
Recommended article: A new and improved algorithm for the 3-cut problem
Recommended article: Improved heuristics for sequencing cutting patterns
Recommended article: Solving sequential interval cutting problems via dynamic programming
description: scientific article; zbMATH DE number 6143167