The modified integer round-up property of the one-dimensional cutting stock problem
From MaRDI portal
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
- A Linear Programming Approach to the Cutting-Stock Problem
- A typology of cutting and packing problems
- 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
- scientific article; zbMATH DE number 4074379 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3999654 (Why is no real title available?)
- scientific article; zbMATH DE number 797002 (Why is no real title available?)
- Integer Rounding for Polymatroid and Branching Optimization Problems
- The cutting stock problem and integer rounding
Cited in
(37)- Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths
- Bidimensional packing by bilinear programming
- 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
- Families of non-IRUP instances of the one-dimensional cutting stock problem
- 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
- Tighter relaxations for the cutting stock problem
- A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
- A simple OPT+1 algorithm for cutting stock under the modified integer round-up property assumption
- 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
- Modified greedy heuristic for the one-dimensional cutting stock problem
- A residual recombination heuristic for one-dimensional cutting stock problems
- A rounding theorem for unique binary tomographic reconstruction
- Minimal proper non-IRUP instances of the one-dimensional cutting stock problem
- Bounds for the Nakamura number
- Large proper gaps in bin packing and dual bin packing problems
- Sufficient conditions for the integer round-up property to be violated for the linear cutting stock problem
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
- A note on the approximability of cutting stock problems
- Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
- The cutting stock problem and integer rounding
- Tighter Bounds for the Gap and Non-IRUP Constructions in the One-dimensional Cutting Stock Problem
- The skiving stock problem as a counterpart of the cutting stock problem
- Sensitive instances of the cutting stock problem
- Constructing an instance of the cutting stock problem of minimum size which does not possess the integer round-up property
- Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB)
- High-multiplicity \(N\)-fold IP via configuration LP
- Supermajority politics: equilibrium range, policy diversity, utilitarian welfare, and political compromise
- Nested \((2,3)\)-instances of the cutting stock problem
- Scheduling kernels via configuration LP
- Bin packing with thresholds: mathematical models and theoretical results
- Stabilized branch-and-price algorithms for vector packing problems
- A brief history of parameterized algorithms for block-structured integer programs (invited talk)
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)
