A classification scheme for bin packing theory
AbstractClassifications 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 . A similar effort was made by Dyckhoff  for cutting and packing problems. Such classification schemes can be combined with comprehensive bibliographies, e.g., the one provided for scheduling theory by Bruckner 1. 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.
Download data is not yet available.
How to Cite
Coffman, E. G., & Csirik, J. (2007). A classification scheme for bin packing theory. Acta Cybernetica, 18(1), 47-60. Retrieved from https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3705