New cases of the cutting stock problem having MIRUP

DOI10.1007/s001860050015zbMath0927.90093OpenAlexW2034024644MaRDI QIDQ1298738

Christoph Nitsche, Guntram Scheithauer, Johannes Terno

Publication date: 22 August 1999

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001860050015

zbMATH Keywords

linear relaxationone-dimensional cutting stocklinear integer minimizationmodified integer round-up property

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Related Items (5)

Tighter Bounds for the Gap and Non-IRUP Constructions in the One-dimensional Cutting Stock Problem ⋮ On the bin packing problem with a fixed number of object weights ⋮ Nested \((2,3)\)-instances of the cutting stock problem ⋮ A simple \(OPT+1\) algorithm for cutting stock under the modified integer round-up property assumption ⋮ Tighter relaxations for the cutting stock problem

This page was built for publication: New cases of the cutting stock problem having MIRUP