Nested \((2,3)\)-instances of the cutting stock problem
From MaRDI portal
Publication:6134054
DOI10.1007/978-3-031-35305-5_10zbMath1528.90157OpenAlexW4381956398MaRDI QIDQ6134054
Publication date: 21 August 2023
Published in: Mathematical Optimization Theory and Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-35305-5_10
Integer programming (90C10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Cites Work
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Large gaps in one-dimensional cutting stock problems
- 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
- 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
- Families of non-IRUP instances of the one-dimensional cutting stock problem
- A simple \(OPT+1\) algorithm for cutting stock under the modified integer round-up property assumption
- Minimal proper non-IRUP instances of the one-dimensional cutting stock problem
- Large proper gaps in bin packing and dual bin packing problems
- Mathematical Methods of Organizing and Planning Production
- A Linear Programming Approach to the Cutting-Stock Problem
- Integer Rounding for Polymatroid and Branching Optimization Problems
- Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
- Tighter Bounds for the Gap and Non-IRUP Constructions in the One-dimensional 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
This page was built for publication: Nested \((2,3)\)-instances of the cutting stock problem
