Sufficient conditions for the integer round-up property to be violated for the linear cutting stock problem

DOI10.1023/B:AURC.0000019372.73750.3BzbMATH Open1115.90366OpenAlexW2061461353MaRDI QIDQ2487734FDOQ2487734

Authors: V. M. Kartak 

Publication date: 8 August 2005

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:aurc.0000019372.73750.3b

Recommendations

• An instance of the cutting stock problem for which the rounding property does not hold
• Constructing an instance of the cutting stock problem of minimum size which does not possess the integer round-up property
• 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

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cited In (6)

• Local search of orthogonal packings using the lower bounds
• Bin packing and cutting stock problems: mathematical models and exact algorithms
• An instance of the cutting stock problem for which the rounding property does not hold
• Constructing an instance of the cutting stock problem of minimum size which does not possess the integer round-up property
• The cutting stock problem and integer rounding
• Minimal proper non-IRUP instances of the one-dimensional cutting stock problem

This page was built for publication: Sufficient conditions for the integer round-up property to be violated for the linear cutting stock problem

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