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

DOI10.1080/0233193021000066545zbMath1038.90058MaRDI QIDQ4805783

Jürgen Rietz, Guntram Scheithauer, 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 relaxation; one-dimensional cutting stock problem; modified integer round-up property

Mathematics Subject Classification ID

90C10: Integer programming

90B80: Discrete location and assignment

Related Items

Large gaps in one-dimensional cutting stock problems

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