MULTIDIMENSIONAL BIN PACKING ALGORITHMS

被引：44
|
作者：
KOU, LT [1 ]
MARKOWSKY, G [1 ]
机构：
[1] IBM CORP,THOMAS J WATSON RES CTR,DIV RES,YORKTOWN HTS,NY 10598
来源：
IBM JOURNAL OF RESEARCH AND DEVELOPMENT | 1977年 / 21卷 / 05期
关键词：
D O I：
10.1147/rd.215.0443
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：443 / 448
页数：6
相关论文
共 50 条
  • [1] Improved approximation algorithms for multidimensional bin packing problems
    Bansal, Nikhil
    Caprara, Alberto
    Sviridenko, Maxim
    47TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2006, : 697 - +
  • [2] Approximation and online algorithms for multidimensional bin packing: A survey
    Christensen, Henrik I.
    Khan, Arindam
    Pokutta, Sebastian
    Tetali, Prasad
    COMPUTER SCIENCE REVIEW, 2017, 24 : 63 - 79
  • [3] MULTIDIMENSIONAL ONLINE BIN PACKING - ALGORITHMS AND WORST-CASE ANALYSIS
    COPPERSMITH, D
    RAGHAVAN, P
    OPERATIONS RESEARCH LETTERS, 1989, 8 (01) : 17 - 20
  • [4] Multidimensional Bin Packing Revisited
    Moffitt, Michael D.
    PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING, CP 2013, 2013, 8124 : 513 - 528
  • [5] AN ONLINE ALGORITHM FOR MULTIDIMENSIONAL BIN PACKING
    CSIRIK, J
    VANVLIET, A
    OPERATIONS RESEARCH LETTERS, 1993, 13 (03) : 149 - 158
  • [6] NEW ALGORITHMS FOR BIN PACKING
    YAO, ACC
    JOURNAL OF THE ACM, 1980, 27 (02) : 207 - 227
  • [7] FAST ALGORITHMS FOR BIN PACKING
    JOHNSON, DS
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1974, 8 (03) : 272 - 314
  • [8] Approximation algorithms for extensible bin packing
    Coffman, EG
    Lueker, GS
    PROCEEDINGS OF THE TWELFTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2001, : 586 - 588
  • [9] Approximation Algorithms for Extensible Bin Packing
    E. G. Coffman
    George S. Lueker
    Journal of Scheduling, 2006, 9 : 63 - 69
  • [10] Approximation algorithms for extensible bin packing
    Coffman, EG
    Lueker, GS
    JOURNAL OF SCHEDULING, 2006, 9 (01) : 63 - 69
12345