ISSN:
1432-5217
Keywords:
Key words: Cutting stock problem
;
linear relaxation
;
modified integer round-up property
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
,
Economics
Notes:
Abstract. The modified integer round-up property (MIRUP) for a linear integer minimization problem means that the optimal value of this problem is not greater than the optimal value of the corresponding LP relaxation rounded up plus one. In earlier papers the MIRUP was shown to hold for the so-called divisible case and some other subproblems of the one-dimensional cutting stock problem. In this paper we extend the results by using special transformations, proving the existence of non-elementary patterns in the solution, and using more detailed greedy techniques.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/s001860050015
Permalink
