Large gaps in one-dimensional cutting stock problems

DOI10.1016/J.DAM.2007.08.052MaRDI QIDQ944749zbMATH OpenOpenAlexFDO

Authors Stephan Dempe, Jürgen Rietz

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

zbMATH Keywords

approximate solutionlinear relaxationone-dimensional cutting stock probleminteger round up property

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 827989
• Families of non-IRUP instances of the one-dimensional cutting stock problem
• scientific article; zbMATH DE number 1594516
• Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm
• Sensitive instances of the cutting stock problem

Cites work

• scientific article; zbMATH DE number 1094755 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• A Linear Programming Approach to the Cutting-Stock Problem
• A near-optimal solution to a two-dimensional cutting stock problem
• An instance of the cutting stock problem for which the rounding property does not hold
• Approximation algorithms for NP-hard problems.
• Families of non-IRUP instances of the one-dimensional cutting stock problem
• Heuristics for the integer one-dimensional cutting stock problem: A computational study
• Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm
• The cutting stock problem and integer rounding
• Tighter Bounds for the Gap and Non-IRUP Constructions in the One-dimensional Cutting Stock Problem

Cited in

(14)

• Families of non-IRUP instances of the one-dimensional cutting stock problem
• Conservative scales in packing problems
• scientific article; zbMATH DE number 1594516 (Why is no real title available?)
• Large proper gaps in bin packing and dual bin packing problems
• An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case
• scientific article; zbMATH DE number 827989 (Why is no real title available?)
• Bin packing and cutting stock problems: mathematical models and exact algorithms
• A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems
• Sensitive instances of the cutting stock problem
• Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory
• Tighter Bounds for the Gap and Non-IRUP Constructions in the One-dimensional Cutting Stock Problem
• 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
• Minimal proper non-IRUP instances of the one-dimensional cutting stock problem

This page was built for publication: Large gaps in one-dimensional cutting stock problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q944749)