Tighter Bounds for the Gap and Non-IRUP Constructions in the One-dimensional Cutting Stock Problem

DOI10.1080/0233193021000066545zbMath1038.90058OpenAlexW1985517965MaRDI QIDQ4805783

Guntram Scheithauer, Jürgen Rietz, Johannes Terno

Publication date: 2002

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0233193021000066545

zbMATH Keywords

continuous relaxationone-dimensional cutting stock problemmodified integer round-up property

Mathematics Subject Classification ID

Integer programming (90C10) Discrete location and assignment (90B80)

Related Items (6)

Constructing an instance of the cutting stock problem of minimum size which does not possess the integer round-up property ⋮ Nested \((2,3)\)-instances of the cutting stock problem ⋮ Large gaps in one-dimensional cutting stock problems ⋮ Sensitive Instances of the Cutting Stock Problem ⋮ Friendly bin packing instances without integer round-up property ⋮ Minimal proper non-IRUP instances of the one-dimensional cutting stock problem

Cites Work

• An instance of the cutting stock problem for which the rounding property does not hold
• The modified integer round-up property of the one-dimensional cutting stock problem
• New cases of the cutting stock problem having MIRUP
• Families of non-IRUP instances of the one-dimensional cutting stock problem
• Tighter relaxations for the cutting stock problem
• Heuristics for the integer one-dimensional cutting stock problem: A computational study
• A Linear Programming Approach to the Cutting-Stock Problem
• The cutting stock problem and integer rounding
• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
• Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm

This page was built for publication: Tighter Bounds for the Gap and Non-IRUP Constructions in the One-dimensional Cutting Stock Problem