The cutting stock problem in a hardboard industry: A case study.
type: Item
instance of: scholarly article
title: The cutting stock problem in a hardboard industry: A case study.
zbMATH Open document ID: 1042.90582
DOI: 10.1016/S0305-0548(97)00087-7
author: Reinaldo Morabito
author: Valdir Garcia
published in: Computers \& Operations Research
publication date: 2003-09-07T00:00:00Z
Mathematics Subject Classification ID: 90B90
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 1975775
zbMATH Keywords: Operations research
zbMATH Keywords: Cutting
zbMATH Keywords: Mathematical models
zbMATH Keywords: Integer programming
zbMATH Keywords: Problem solving
zbMATH Keywords: Dynamic programming
zbMATH Keywords: Random processes
zbMATH Keywords: Microcomputers
zbMATH Keywords: Cutting stock problems
describes a project that uses: GAMS
MaRDI profile type: Publication
cites work: A Linear Programming Approach to the Cutting Stock Problem—Part II
cites work: A typology of cutting and packing problems
cites work: Packing problems
cites work: Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
cites work: Cutting and packing. Special issue
cites work: A Linear Programming Approach to the Cutting-Stock Problem
cites work: Multistage Cutting Stock Problems of Two and More Dimensions
cites work: The trim-loss and assortment problems: A survey
cites work: Q3724077
cites work: The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems
cites work: Performance Of Two Heuristics For Solving Large Scale Two-Dimensional Guillotine Cutting Problems
cites work: Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
cites work: The Theory and Computation of Knapsack Functions
cites work: Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
cites work: The G4-Heuristic for the Pallet Loading Problem
cites work: Recursive Computational Procedure for Two-dimensional Stock Cutting
cites work: An Algorithm for Two-Dimensional Cutting Problems
full work available at URL: s0305-0548(97)00087-7
OpenAlex ID: W2092151354
description: scientific article; zbMATH DE number 1975775