Solving sequential interval cutting problems via dynamic programming
type: Item
instance of: scholarly article
title: Solving sequential interval cutting problems via dynamic programming
zbMATH Open document ID: 0761.90083
DOI: 10.1016/0377-2217(92)90344-9
author: Knut Richter
published in: European Journal of Operational Research
publication date: 1993-01-16T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 91829
zbMATH Keywords: cutting stock
zbMATH Keywords: sequential one-dimensional cutting
MaRDI profile type: Publication
full work available at URL: 0377-2217(92)90344-9
OpenAlex ID: W1989133164
cites work: Q3241581
cites work: A typology of cutting and packing problems
cites work: Q5569992
cites work: Q3805803
description: scientific article; zbMATH DE number 91829