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

DOI10.1016/S0166-218X(01)00361-4zbMath1027.90074MaRDI QIDQ1613404

Jürgen Rietz, Guntram Scheithauer, Johannes Terno

Publication date: 29 August 2002

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

zbMATH Keywords

continuous relaxation; one-dimensional cutting stock problem; integer round-up property

Mathematics Subject Classification ID

90C06: Large-scale problems in mathematical programming

90C27: Combinatorial optimization

Related Items

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, Large gaps in one-dimensional cutting stock problems, An asymptotically exact algorithm for the high-multiplicity bin packing 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