Two-dimensional rectangle packing: on-line methods and results

J. Csirik, J. B.G. Frenk, M. Labbé

Research output: Contribution to journalArticle

19 Citations (Scopus)

Abstract

The first algorithms for the on-line two-dimensional rectangle packing problem were introduced by Coppersmith and Raghavan. They showed that for a family of heuristics 13/4 is an upper bound for the asymptotic worst-case ratios. We have investigated the Next Fit and the First Fit variants of their method. We proved that the asymptotic worst-case ratio equals 13/4 for the Next Fit variant and that 49/16 is an upper bound of the asymptotic worst-case ratio for the First Fit variant.

Original languageEnglish
Pages (from-to)197-204
Number of pages8
JournalDiscrete Applied Mathematics
Volume45
Issue number3
DOIs
Publication statusPublished - Sep 7 1993

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Two-dimensional rectangle packing: on-line methods and results'. Together they form a unique fingerprint.

  • Cite this