A classification scheme for bin packing theory

Edward G. Coffman, János Csirik

Research output: Article

8 Citations (Scopus)

Abstract

Classifications of published research place new results in a historical context and in so doing identify open problems. An example in wide use classifies results in scheduling theory according to a scheme originated by Graham, Lawler, Lenstra and Rinnooy Kan [10]. A similar effort was made by Dyckhoff [6] for cutting and packing problems. Such classification schemes can be combined with comprehensive bibliographies, e.g., the one provided for scheduling theory by Bruckner1. This paper describes a novel classification scheme for bin packing which is being applied by the authors to an extensive (and growing) bibliography of the theory. Problem classifications are supplemented by compact descriptions of the main results and of the corresponding algorithms. The usefulness of the scheme is extended by an online search engine. With the help of this software, one is easily able to determine whether results already exist for applications that appear to be new, and to assist in locating the cutting edge of the general theory.

Original languageEnglish
Pages (from-to)47-60
Number of pages14
JournalActa Cybernetica
Volume18
Issue number1
Publication statusPublished - jan. 1 2007

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Software
  • Computer Science (miscellaneous)
  • Computer Vision and Pattern Recognition
  • Management Science and Operations Research
  • Information Systems and Management
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'A classification scheme for bin packing theory'. Together they form a unique fingerprint.

  • Cite this