Title of article
Large gaps in one-dimensional cutting stock problems Original Research Article
Author/Authors
J. Rietz، نويسنده , , S. Dempe، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
7
From page
1929
To page
1935
Abstract
Its linear relaxation is often solved instead of the one-dimensional cutting stock problem (1CSP). This causes a difference between the optimal objective function values of the original problem and its relaxation, called a gap. The size of this gap is considered in this paper with the aim to formulate principles for the construction of instances of the 1CSP with large gaps. These principles are complemented by examples for such instances.
Keywords
Integer round up property , Approximate solution , Linear relaxation , One-dimensional cutting stock problem
Journal title
Discrete Applied Mathematics
Serial Year
2008
Journal title
Discrete Applied Mathematics
Record number
886790
Link To Document