#### Filter Results:

#### Publication Year

1978

1999

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

The modified integer roundup 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 sub-problems of the one-dimensional… (More)

In the cutting stock problem (CSP) a given order for smaller pieces has to be cut from larger stock material in such a way that the number of stock material needed is minimal. Based on the classical integer linear programming model the common solution technique consists of solving the corresponding continuous relaxation problem followed by several… (More)

- ‹
- 1
- ›