Large gaps in one-dimensional cutting stock problems
From MaRDI portal
Publication:944749
DOI10.1016/j.dam.2007.08.052zbMath1160.90555OpenAlexW1995334495MaRDI QIDQ944749
Publication date: 10 September 2008
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2007.08.052
Related Items
Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ Constructing an instance of the cutting stock problem of minimum size which does not possess the integer round-up property ⋮ Large proper gaps in bin packing and dual bin packing problems ⋮ Nested \((2,3)\)-instances of the cutting stock problem ⋮ Conservative scales in packing problems ⋮ Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory ⋮ 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 ⋮ Sensitive Instances of the Cutting Stock Problem ⋮ Minimal proper non-IRUP instances of the one-dimensional cutting stock problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An instance of the cutting stock problem for which the rounding property does not hold
- Families of non-IRUP instances of the one-dimensional cutting stock problem
- Heuristics for the integer one-dimensional cutting stock problem: A computational study
- A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
- A Linear Programming Approach to the Cutting-Stock Problem
- The cutting stock problem and integer rounding
- Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm
- Tighter Bounds for the Gap and Non-IRUP Constructions in the One-dimensional Cutting Stock Problem
