Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem
type: Item
instance of: scholarly article
title: Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem
zbMATH Open document ID: 0890.90147
DOI: 10.1016/S0167-6377(96)00047-8
author: Guntram Scheithauer
author: Johannes Terno
published in: Operations Research Letters
publication date: 1997-12-17T00:00:00Z
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 1097692
zbMATH Keywords: rounding
zbMATH Keywords: one-dimensional cutting stock problem
MaRDI profile type: Publication
cites work: Integer Rounding for Polymatroid and Branching Optimization Problems
cites work: Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
cites work: A Linear Programming Approach to the Cutting-Stock Problem
cites work: Q4726042
cites work: The cutting stock problem and integer rounding
cites work: An instance of the cutting stock problem for which the rounding property does not hold
cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
cites work: Q3989344
cites work: Modeling of packing problems
cites work: The modified integer round-up property of the one-dimensional cutting stock problem
cites work: Q3805803
cites work: CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
Wikidata QID: Q127089135
description: scientific article; zbMATH DE number 1097692