The modified integer round-up property of the one-dimensional cutting stock problem

DOI10.1016/0377-2217(95)00022-IzbMath0918.90123OpenAlexW2096291703MaRDI QIDQ1127208

Guntram Scheithauer, Johannes Terno

Publication date: 25 August 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(95)00022-i

zbMATH Keywords

one-dimensional cutting stocklinear integer minimizationmodified integer round-up property

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Related Items (30)

Families of non-IRUP instances of the one-dimensional cutting stock problem ⋮ A residual recombination heuristic for one-dimensional cutting stock problems ⋮ Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges ⋮ Tighter Bounds for the Gap and Non-IRUP Constructions in the One-dimensional Cutting Stock Problem ⋮ Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ The skiving stock problem as a counterpart of the cutting stock problem ⋮ A note on the approximability of cutting stock problems ⋮ Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem ⋮ Bounds for the Nakamura number ⋮ High-multiplicity \(N\)-fold IP via configuration LP ⋮ Supermajority politics: equilibrium range, policy diversity, utilitarian welfare, and political compromise ⋮ Large proper gaps in bin packing and dual bin packing problems ⋮ Nested \((2,3)\)-instances of the cutting stock problem ⋮ A simple \(OPT+1\) algorithm for cutting stock under the modified integer round-up property assumption ⋮ Lower bounds and algorithms for the minimum cardinality bin covering problem ⋮ A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems ⋮ Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation ⋮ An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case ⋮ Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB) ⋮ A rounding theorem for unique binary tomographic reconstruction ⋮ Stabilized branch-and-price algorithms for vector packing problems ⋮ Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths ⋮ Sensitive Instances of the Cutting Stock Problem ⋮ Tighter relaxations for the cutting stock problem ⋮ Modified greedy heuristic for the one-dimensional cutting stock problem ⋮ Bidimensional packing by bilinear programming ⋮ A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems ⋮ A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths ⋮ A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting ⋮ Minimal proper non-IRUP instances of the one-dimensional cutting stock problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An instance of the cutting stock problem for which the rounding property does not hold
• CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
• A typology of cutting and packing problems
• A Linear Programming Approach to the Cutting-Stock Problem
• Integer Rounding for Polymatroid and Branching Optimization Problems
• The cutting stock problem and integer rounding

This page was built for publication: The modified integer round-up property of the one-dimensional cutting stock problem