Families of non-IRUP instances of the one-dimensional cutting stock problem
type: Item
instance of: scholarly article
title: Families of non-IRUP instances of the one-dimensional cutting stock problem
zbMATH Open document ID: 1027.90074
DOI: 10.1016/S0166-218X(01)00361-4
author: Jürgen Rietz
author: Guntram Scheithauer
author: Johannes Terno
published in: Discrete Applied Mathematics
publication date: 2002-08-29T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C06
zbMATH DE Number: 1792345
zbMATH Keywords: one-dimensional cutting stock problem
zbMATH Keywords: continuous relaxation
zbMATH Keywords: integer round-up property
MaRDI profile type: Publication
cites work: Integer Rounding for Polymatroid and Branching Optimization Problems
cites work: Q4880190
cites work: Q4398379
cites work: Q4368542
cites work: Q4198056
cites work: A Linear Programming Approach to the Cutting-Stock Problem
cites work: Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
cites work: An instance of the cutting stock problem for which the rounding property does not hold
cites work: Q3993418
cites work: Tighter relaxations for the cutting stock problem
cites work: Q4848284
cites work: The modified integer round-up property of the one-dimensional cutting stock problem
cites work: Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem
cites work: Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm
cites work: Computational study of a column generation algorithm for bin packing and cutting stock problems
cites work: Heuristics for the integer one-dimensional cutting stock problem: A computational study
description: scientific article; zbMATH DE number 1792345