Tighter Bounds for the Gap and Non-IRUP Constructions in the One-dimensional Cutting Stock Problem

The one-dimensional cutting stock problem is investigated with respect to the difference between the optimal function values of the integer programming problem and its continuous relaxation. A tighter bound for this gap is presented, followed by some non-IRUP constructions. Finally, instances with gap 7/6 are constructed, the largest gap known so far.

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

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

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

[4]  Christoph Nitsche,et al.  Tighter relaxations for the cutting stock problem , 1999, Eur. J. Oper. Res..

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

[6]  Christoph Nitsche,et al.  New cases of the cutting stock problem having MIRUP , 1998, Math. Methods Oper. Res..

[7]  Gleb Belov,et al.  Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm , 2001, J. Oper. Res. Soc..

[8]  Mauro Dell'Amico,et al.  Annotated Bibliographies in Combinatorial Optimization , 1997 .

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

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

[11]  Jürgen Rietz,et al.  Families of non-IRUP instances of the one-dimensional cutting stoc problem , 2002, Discret. Appl. Math..

[12]  Eitan Altman,et al.  Asymptotic linear programming and policy improvement for singularly perturbed Markov decision processes , 1999, Math. Methods Oper. Res..

[13]  Gerhard Wäscher,et al.  Heuristics for the integer one-dimensional cutting stock problem: A computational study , 1996 .

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

[15]  Gerhard Wäscher,et al.  Cutting and packing , 1995, Eur. J. Oper. Res..