A method for the cutting stock problem with different qualities
type: Item
instance of: scholarly article
title: A method for the cutting stock problem with different qualities
zbMATH Open document ID: 0903.90136
DOI: 10.1016/0377-2217(94)00023-6
author: Mikael Rönnqvist
published in: European Journal of Operational Research
publication date: 1998-06-11T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B90
zbMATH DE Number: 1162954
zbMATH Keywords: cutting
zbMATH Keywords: decision support system
zbMATH Keywords: integer programming
zbMATH Keywords: optimization
zbMATH Keywords: relaxation
zbMATH Keywords: wooden boards
zbMATH Keywords: set packing
MaRDI profile type: Publication
full work available at URL: 0377-2217(94)00023-6
OpenAlex ID: W2093579978
cites work: Q3134873
cites work: An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems
cites work: Validation of subgradient optimization
cites work: Q4040221
description: scientific article; zbMATH DE number 1162954