The modified integer round-up property of the one-dimensional cutting stock problem
From MaRDI portal
Publication:1127208
DOI10.1016/0377-2217(95)00022-IzbMATH Open0918.90123OpenAlexW2096291703MaRDI QIDQ1127208FDOQ1127208
Authors: 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
Recommendations
- New cases of the cutting stock problem having MIRUP
- Theoretical investigations on the modified integer round-up property for 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
- An instance of the cutting stock problem for which the rounding property does not hold
- The cutting stock problem and integer rounding
Cites Work
- CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
- A Linear Programming Approach to the Cutting-Stock Problem
- Title not available (Why is that?)
- Integer Rounding for Polymatroid and Branching Optimization Problems
- The cutting stock problem and integer rounding
- A typology of cutting and packing problems
- An instance of the cutting stock problem for which the rounding property does not hold
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (34)
- Sufficient conditions for the integer round-up property to be violated for the linear cutting stock problem
- A rounding theorem for unique binary tomographic reconstruction
- Families of non-IRUP instances of the one-dimensional cutting stock problem
- Large proper gaps in bin packing and dual bin packing 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
- A note on the approximability of cutting stock problems
- Supermajority politics: equilibrium range, policy diversity, utilitarian welfare, and political compromise
- High-multiplicity \(N\)-fold IP via configuration LP
- Lower bounds and algorithms for the minimum cardinality bin covering problem
- Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths
- Stabilized branch-and-price algorithms for vector packing problems
- Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges
- A residual recombination heuristic for one-dimensional cutting stock problems
- The skiving stock problem as a counterpart of the cutting stock problem
- A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
- Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB)
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- 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
- Modified greedy heuristic for the one-dimensional cutting stock problem
- Bidimensional packing by bilinear programming
- An instance of the cutting stock problem for which the rounding property does not hold
- Tighter Bounds for the Gap and Non-IRUP Constructions in the One-dimensional Cutting Stock Problem
- A simple \(OPT+1\) algorithm for cutting stock under the modified integer round-up property assumption
- Theoretical investigations on the modified integer round-up property for 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
- The cutting stock problem and integer rounding
- Tighter relaxations for the cutting stock problem
- 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
- Bounds for the Nakamura number
- 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: The modified integer round-up property 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 Q1127208)
