Nested (2,3)-instances of the cutting stock problem

DOI10.1007/978-3-031-35305-5_10MaRDI QIDQ6134054zbMATH OpenOpenAlexFDO

Authors Artem V. Ripatti

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

zbMATH Keywords

integrality gapcutting stock probleminteger round up property

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Integer programming (90C10) Discrete location and assignment (90B80)

Recommendations

• Sensitive instances of the cutting stock problem
• scientific article; zbMATH DE number 827989
• Families of non-IRUP instances of the one-dimensional cutting stock problem
• Large gaps in one-dimensional cutting stock problems
• Minimal proper non-IRUP instances of the one-dimensional cutting stock problem

Cites work

• A Linear Programming Approach to the Cutting-Stock Problem
• A simple \(OPT+1\) algorithm for cutting stock under the modified integer round-up property assumption
• An instance of the cutting stock problem for which the rounding property does not hold
• Bin packing and cutting stock problems: mathematical models and exact algorithms
• Constructing an instance of the cutting stock problem of minimum size which does not possess the integer round-up property
• Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
• Families of non-IRUP instances of the one-dimensional cutting stock problem
• Integer Rounding for Polymatroid and Branching Optimization Problems
• Large gaps in one-dimensional cutting stock problems
• Large proper gaps in bin packing and dual bin packing problems
• Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
• Minimal proper non-IRUP instances of the one-dimensional cutting stock problem
• New cases of the cutting stock problem having MIRUP
• Sensitive instances of the cutting stock problem
• The modified integer round-up property of the one-dimensional cutting stock problem
• Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem
• Tighter Bounds for the Gap and Non-IRUP Constructions in the One-dimensional Cutting Stock Problem

Cited in

(1)

• A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem

This page was built for publication: Nested \((2,3)\)-instances of the cutting stock problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6134054)