We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
New cases of the cutting stock problem having MIRUP.
- Authors
Nitsche, Christoph; Scheithauer, Guntram; Terno, Johannes
- Abstract
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.
- Subjects
CUTTING stock problem; INTEGER programming; LINEAR programming
- Publication
Mathematical Methods of Operations Research, 1998, Vol 48, Issue 1, p105
- ISSN
1432-2994
- Publication type
Article
- DOI
10.1007/s001860050015