Publication Cover
Optimization
A Journal of Mathematical Programming and Operations Research
Volume 51, 2002 - Issue 6
42
Views
11
CrossRef citations to date
0
Altmetric
Original Articles

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

, &
Pages 927-963 | Published online: 27 Oct 2010

References

  • Coffman , E.G. Jr. , Garey , M.R. , Johnsonand , D.S. and Tarjan , R.E. 1980 . Performance bounds for level oriented two-dimensional packing algorithms . SIAM J. Comput. , 9 : 808 – 826 .
  • Diegel , A. 1988 . Integer LP solution for large trim problems , South Africa : University of Natal . Working paper
  • Dyckhoff , H. , Scheithauerand , G. and Terno , J. 1997 . “ Cutting and Packing ” . In Annotated Bibliographies in Combinatorial Optimization , Edited by: MaffioliDell'Amico , F. and Maitello , S. Chichester : John Wiley and Sons .
  • Fieldhouse , M. 1990 . The duality gap in trim problems , SICUP-Bulletin No. 5
  • Gilmoreand , P.C. and Gomory , R.E. 1961 . A linear programming approach to the cutting-stock problem (Part I) . Oper. Res. , 9 : 849 – 859 .
  • Marcotte , O. 1985 . Cutting stock problem and integer Founding . Mathematical Programming , 33 : 82 – 92 .
  • Marcotte , O. 1986 . An instance of the cutting stock problem for which the rounding property does not hold . Operations Research Letters , 4/5 : 239 – 243 .
  • Müller , A. 1998 . Anwendung des Schnittebenenverfahrens auf das eindimensionale Zuschnittproblem , TU Dresden . Diploma work
  • Nica , V. 1994 . A General counterxample to the Integer Round-Up property , Bucharest : Department of Economic Cybernetics, Academy of Economic Studies . Working paper
  • Nitsche , C. , Scheithauerand , G. and Terno , J. 1998 . New cases of the cutting stock problem having MIRUP . Math. Meth. Oper. Res. , 48 : 105 – 115 .
  • Nitsche , C. , Scheithauerand , G. and Terno , J. 1999 . Tighter relaxations for the cutting stock problems . European J. ofOper. Res. , 112 : 654 – 663 .
  • Rietz , J. , Scheithauerand , G. and Terno , J. 2002 . Families of non-IRUP instances of the one-dimensional cutting stock problem . Discrete Applied Math. , 121 : 229 – 245 .
  • Scheithauerand , G. and Terno , J. 1992 . About the gap between the optimal values of the integer and continuous relaxation one-dimensional cutting stock problem , Operations Research Proceedings 1991 Berlin : Springer-Verlag .
  • Scheithauerand , G. and Terno , J. 1995 . The Modified integer round-up property of the one-dimensional cutting stock problem . European J. ofOper. Res. , 84 : 562 – 571 .
  • Scheithauer , G. , Terno , J. , Müller , A. and Belov , G. 2001 . Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm . J. Oper. Res. Soc. , 52 : 1390 – 1401 .
  • Terno , J. , Lindemannand , R. and Scheithauer , G. 1987 . Zuschnittprobleme und ihre praktische Lösung , Leipzig : Fachbuchverlag .
  • Wäscher , G. and Gau , T. 1996 . Heuristics for the integer one-dimensional cutting stock problem: a computational study . OR Spektrum , 18 : 131 – 144 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.