Establishing the optimality of sequencing heuristics for cutting stock problems
type: Item
instance of: scholarly article
title: Establishing the optimality of sequencing heuristics for cutting stock problems
zbMATH Open document ID: 0918.90125
DOI: 10.1016/0377-2217(95)00025-L
author: Boon J. Yuen
author: Ken Richardson
published in: European Journal of Operational Research
publication date: 1999-08-19T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1189576
zbMATH Keywords: branch-and-bound
zbMATH Keywords: cutting stock
zbMATH Keywords: exact methods
zbMATH Keywords: lower bound
MaRDI profile type: Publication
cites work: Glass cutting in a small firm
cites work: Q3888839
cites work: An Application of Travelling-Salesman Routines to Solve Pattern-Allocation Problems in the Glass Industry
cites work: Heuristics for sequencing cutting patterns
cites work: Improved heuristics for sequencing cutting patterns
description: scientific article; zbMATH DE number 1189576