A simple \(OPT+1\) algorithm for cutting stock under the modified integer round-up property assumption

DOI10.1016/j.ipl.2011.02.009zbMath1260.90139OpenAlexW2055736810MaRDI QIDQ1944927

Klaus Jansen, Roberto Solis-Oba

Publication date: 28 March 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.02.009

zbMATH Keywords

algorithmscutting stockmodified integer round-up property

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The modified integer round-up property of the one-dimensional cutting stock problem
• Geometric algorithms and combinatorial optimization
• New cases of the cutting stock problem having MIRUP
• Carathéodory bounds for integer cones
• The Trim Problem
• A Linear Programming Approach to the Cutting-Stock Problem
• An OPT + 1 Algorithm for the Cutting Stock Problem with Constant Number of Object Lengths
• Bin Packing with Fixed Number of Bins Revisited
• Integer Rounding for Polymatroid and Branching Optimization Problems
• The cutting stock problem and integer rounding
• Minkowski's Convex Body Theorem and Integer Programming
• A polynomial algorithm for integer programming covering problems satisfying the integer round-up property
• Linear Programming

This page was built for publication: A simple \(OPT+1\) algorithm for cutting stock under the modified integer round-up property assumption