Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem

DOI10.1016/S0167-6377(96)00047-8zbMath0890.90147WikidataQ127089135 ScholiaQ127089135MaRDI QIDQ1376328

Guntram Scheithauer, Johannes Terno

Publication date: 17 December 1997

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

roundingone-dimensional cutting stock problem

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (15)

Families of non-IRUP instances of the one-dimensional cutting stock problem ⋮ A Fast Approximation Scheme for the Multiple Knapsack Problem ⋮ Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ Approximation and online algorithms for multidimensional bin packing: a survey ⋮ On the bin packing problem with a fixed number of object weights ⋮ Large proper gaps in bin packing and dual bin packing problems ⋮ Nested \((2,3)\)-instances of the cutting stock problem ⋮ Tighter relaxations for the cutting stock problem ⋮ Better Bin Packing Approximations via Discrepancy Theory ⋮ A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems ⋮ About the Structure of the Integer Cone and Its Application to Bin Packing ⋮ Solving robust bin-packing problems with a branch-and-price approach ⋮ The one-dimensional cutting stock problem with due dates ⋮ A branch-and-price algorithm for the temporal bin packing problem ⋮ Minimal proper non-IRUP instances of the one-dimensional cutting stock problem

Cites Work

• 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
• CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
• A Linear Programming Approach to the Cutting-Stock Problem
• Integer Rounding for Polymatroid and Branching Optimization Problems
• The cutting stock problem and integer rounding
• Modeling of packing problems
• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem