New cases of the cutting stock problem having MIRUP

Christoph Nitsche, Guntram Scheithauer and Johannes Terno

Mathematical Methods of Operations Research, 1998, vol. 48, issue 1, 105-115

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. Copyright Springer-Verlag Berlin Heidelberg 1998

Keywords: Key words: Cutting stock problem; linear relaxation; modified integer round-up property (search for similar items in EconPapers)
Date: 1998
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://hdl.handle.net/10.1007/PL00020909 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:mathme:v:48:y:1998:i:1:p:105-115

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186

DOI: 10.1007/PL00020909

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().