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

@inproceedings{Rietz2000TighterBF,
  title={Tighter Bounds for the Gap and Non-irup Constructions in the One-dimensional Cutting Stock Problem},
  author={J Urgen Rietz and Guntram Scheithauer and Johannes Terno},
  year={2000}
}
In the nal stage of this work, Prof. Dr. Johannes Terno passed away after a long serious illness. He will stay in our mind for ever. Abstract The one-dimensional cutting stock problem is investigated with respect to the diierence between the optimal function value of the discrete problem and its continnuous 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. 

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 17 references

Belov: Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm

  • G Scheithauer, J Terno, A M Uller
  • Belov: Solving one-dimensional cutting stock…
  • 1999

M uller: Anwendung des Schnittebenenverfahrens auf das eindimensionale Zuschnittproblem. diploma work

  • M uller: Anwendung des Schnittebenenverfahrens…
  • 1998

Terno: New cases of the cutting stock problem having MIRUP

  • C Nitsche, G Scheithauer
  • Math Meth Oper Res
  • 1998

Terno: Cutting and Packing. Annotated Bibliographies in Combinatorial Optimization

  • G Dyckhoo, J Scheithauer
  • Terno: Cutting and Packing. Annotated…
  • 1997

Gau: Heuristics for the Integer One-dimensional Cutting Stock Problem: a computational study

  • G Ww Ascher
  • OR Spektrum
  • 1996

Terno: The Modiied Integer Round-Up Property of the One- Dimensional Cutting Stock Problem

  • J Scheithauer
  • European Journal of Operational Research
  • 1995

A general counterexample to the Integer Round-Up property. (unpublished ) working paper, Department of Economic Cybernetics

  • V Nica
  • Academy of Economic Studies
  • 1994

The duality gap in trim problems

  • M Fieldhouse
  • The duality gap in trim problems
  • 1990

Similar Papers

Loading similar papers…