Constructing an instance of the cutting stock problem of minimum size which does not possess the integer round-up property

DOI10.33048/daio.2020.27.665zbMath1495.90111OpenAlexW4252903324MaRDI QIDQ5090148

Artem V. Ripatti, Vadim M. Kartak

Publication date: 15 July 2022

Published in: Diskretnyi analiz i issledovanie operatsii (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/da947

zbMATH Keywords

cutting stock problemintegrality gapinteger round-up property

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10)

Related Items (1)

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

Cites Work

• The minimum raster set problem and its application to the \(d\)-dimensional orthogonal packing problem
• Large gaps in one-dimensional cutting stock problems
• An instance of the cutting stock problem for which the rounding property does not hold
• Families of non-IRUP instances of the one-dimensional cutting stock problem
• Minimal proper non-IRUP instances of the one-dimensional cutting stock problem
• 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 Linear Programming Approach to the Cutting-Stock Problem
• Integer Rounding for Polymatroid and Branching Optimization Problems
• Tighter Bounds for the Gap and Non-IRUP Constructions in the One-dimensional Cutting Stock Problem

This page was built for publication: Constructing an instance of the cutting stock problem of minimum size which does not possess the integer round-up property