Families of non-IRUP instances of the one-dimensional cutting stock problem
From MaRDI portal
Publication:1613404
DOI10.1016/S0166-218X(01)00361-4zbMath1027.90074MaRDI QIDQ1613404
Johannes Terno, Jürgen Rietz, Guntram Scheithauer
Publication date: 29 August 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items (17)
Tighter Bounds for the Gap and Non-IRUP Constructions in the One-dimensional Cutting Stock Problem ⋮ On the bin packing problem with a fixed number of object weights ⋮ 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 ⋮ Conservative scales in packing problems ⋮ Large gaps in one-dimensional cutting stock problems ⋮ The proper relaxation and the proper gap of the skiving stock problem ⋮ Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory ⋮ Integer rounding and modified integer rounding for the skiving stock problem ⋮ A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems ⋮ An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case ⋮ The minimum raster set problem and its application to the \(d\)-dimensional orthogonal packing problem ⋮ Sensitive Instances of the Cutting Stock Problem ⋮ One-dimensional relaxations and LP bounds for orthogonal packing ⋮ An asymptotically exact algorithm for the high-multiplicity bin packing problem ⋮ Friendly bin packing instances without integer round-up property ⋮ Minimal proper non-IRUP instances of the one-dimensional cutting stock problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Theoretical investigations on the modified integer round-up property for 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
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- A Linear Programming Approach to the Cutting-Stock Problem
- Integer Rounding for Polymatroid and Branching Optimization Problems
- Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
- Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm
This page was built for publication: Families of non-IRUP instances of the one-dimensional cutting stock problem
