论文信息 - A BRANCH&BOUND ALGORITHM FOR SOLVING ONE-DIMENSIONAL CUTTING STOCK PROBLEMS EXACTLY

A BRANCH&BOUND ALGORITHM FOR SOLVING ONE-DIMENSIONAL CUTTING STOCK PROBLEMS EXACTLY

Many numerical computations reported in the literature show only a small difference between the optimal value of the one-dimensional cutting stock problem (1CSP) and that of the corresponding linear programming relaxation. Moreover, theoretical investigations have proven that this difference is smaller than 2 for a wide range of subproblems of the general 1CSP. In this paper we give a branch&bound algorithm to compute optimal solutions for instances of the 1CSP. Numerical results are presented of about 900 randomly generated instances with up to 100 small pieces and all of them are optimally solved.

G S C H E I T H A U | J T E R N | G. S C H E I T H A U | J. T E R N

[1] Odile Marcotte. An instance of the cutting stock problem for which the rounding property does not hold , 1986 .

[2] Harald Dyckhoff,et al. Cutting and Packing in Production and Distribution , 1992 .

[3] Martin Fieldhouse. The duality gap in trim problems: not yet solved , 1997 .

[4] L. Trotter,et al. Integer Rounding for Polymatroid and Branching Optimization Problems , 1981 .

[5] Guntram Scheithauer,et al. About the Gap Between the Optimal Values of the Integer and Continuous Relaxation One-Dimensional Cutting Stock Problem , 1992 .

[6] R. Gomory,et al. A Linear Programming Approach to the Cutting-Stock Problem , 1961 .

[7] Robert E. Tarjan,et al. Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms , 1980, SIAM J. Comput..

[8] Odile Marcotte. The cutting stock problem and integer rounding , 1985, Math. Program..

[9] Guntram Scheithauer,et al. The modified integer round-up property of the one-dimensional cutting stock problem , 1995 .

[10] Guntram Scheithauer,et al. Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem , 1997, Oper. Res. Lett..