Families of non-IRUP instances of the one-dimensional cutting stock problem

DOI10.1016/S0166-218X(01)00361-4zbMATH Open1027.90074MaRDI QIDQ1613404FDOQ1613404

Authors: Jürgen Rietz, Guntram Scheithauer, Johannes Terno 

Publication date: 29 August 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Recommendations

• Minimal proper non-IRUP instances of 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
• Tighter Bounds for the Gap and Non-IRUP Constructions in the One-dimensional Cutting Stock Problem
• Sensitive instances of the cutting stock problem
• Large gaps in one-dimensional cutting stock problems

zbMATH Keywords

continuous relaxationone-dimensional cutting stock probleminteger round-up property

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Combinatorial optimization (90C27)

Cites Work

• A Linear Programming Approach to the Cutting-Stock Problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Integer Rounding for Polymatroid and Branching Optimization Problems
• Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
• The modified integer round-up property of the one-dimensional cutting stock problem
• Computational study of a column generation algorithm for bin packing and cutting stock problems
• Title not available (Why is that?)
• An instance of the cutting stock problem for which the rounding property does not hold
• 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
• Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (18)

• Conservative scales in packing problems
• An asymptotically exact algorithm for the high-multiplicity bin packing problem
• An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case
• Title not available (Why is that?)
• The minimum raster set problem and its application to the \(d\)-dimensional orthogonal packing problem
• One-dimensional relaxations and LP bounds for orthogonal packing
• On the bin packing problem with a fixed number of object weights
• Sensitive instances of the cutting stock problem
• A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems
• Large gaps in one-dimensional cutting stock problems
• 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
• Integer rounding and modified integer rounding for the skiving stock problem
• The proper relaxation and the proper gap of the skiving stock problem
• Nested \((2,3)\)-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

This page was built for publication: Families of non-IRUP instances of the one-dimensional cutting stock problem

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