Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem

Authors:
Guntram Scheithauer;Johannes Terno
Affiliations:
Dresden University of Technology, Institute of Numerical Mathematics, Mommsenstr. 13, D-01062 Dresden, Germany;Dresden University of Technology, Institute of Numerical Mathematics, Mommsenstr. 13, D-01062 Dresden, Germany
Venue:
Operations Research Letters
Year:
1997

Citing 2
Cited 7

Integer and combinatorial optimization

Integer and combinatorial optimization
An instance of the cutting stock problem for which the rounding property does not hold

Operations Research Letters

Families of non-IRUP instances of the one-dimensional cutting stock problem

Discrete Applied Mathematics
A local search approach for the pattern restricted one dimensional cutting stock problem

Metaheuristics
On the configuration-LP for scheduling on unrelated machines

ESA'11 Proceedings of the 19th European conference on Algorithms
Bin packing via discrepancy of permutations

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
A fast approximation scheme for the multiple knapsack problem

SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Approximation algorithms for scheduling and packing problems

WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Bin Packing via Discrepancy of Permutations

ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many numerical computations show a small difference only between the optimal value of the one-dimensional cutting stock problem and that of its corresponding linear programming relaxation. In this paper we investigate the one-dimensional cutting stock problem with respect to the modified integer round-up property (MIRUP) and present some results on subproblems having the MIRUP.