PARALLEL APPROXIMATION ALGORITHMS FOR BIN PACKING

被引:23
|
作者
ANDERSON, RJ
MAYR, EW
WARMUTH, MK
机构
[1] STANFORD UNIV,DEPT COMP SCI,STANFORD,CA 94305
[2] UNIV CALIF SANTA CRUZ,DEPT COMP SCI,SANTA CRUZ,CA 95064
关键词
D O I
10.1016/0890-5401(89)90003-5
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:262 / 277
页数:16
相关论文
共 50 条
  • [41] Streaming Algorithms for Bin Packing and Vector Scheduling
    Graham Cormode
    Pavel Veselý
    Theory of Computing Systems, 2021, 65 : 916 - 942
  • [42] Algorithms for the bin packing problem with overlapping items
    Grange, Aristide
    Kacem, Imed
    Martin, Sebastien
    COMPUTERS & INDUSTRIAL ENGINEERING, 2018, 115 : 331 - 341
  • [43] Fast algorithms for fragmentable items bin packing
    Benjamin Byholm
    Ivan Porres
    Journal of Heuristics, 2018, 24 : 697 - 723
  • [44] ONLINE ALGORITHMS FOR A DUAL VERSION OF BIN PACKING
    CSIRIK, J
    TOTIK, V
    DISCRETE APPLIED MATHEMATICS, 1988, 21 (02) : 163 - 167
  • [45] Algorithms for the variable sized bin packing problem
    Kang, J
    Park, S
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 147 (02) : 365 - 372
  • [46] Fast algorithms for fragmentable items bin packing
    Byholm, Benjamin
    Porres, Ivan
    JOURNAL OF HEURISTICS, 2018, 24 (05) : 697 - 723
  • [47] Streaming Algorithms for Bin Packing and Vector Scheduling
    Cormode, Graham
    Vesely, Pavel
    THEORY OF COMPUTING SYSTEMS, 2021, 65 (06) : 916 - 942
  • [48] Streaming Algorithms for Bin Packing and Vector Scheduling
    Cormode, Graham
    Vesely, Pavel
    APPROXIMATION AND ONLINE ALGORITHMS (WAOA 2019), 2020, 11926 : 72 - 88
  • [49] Comparing online algorithms for bin packing problems
    Epstein, Leah
    Favrholdt, Lene M.
    Kohrt, Jens S.
    JOURNAL OF SCHEDULING, 2012, 15 (01) : 13 - 21
  • [50] Classification and evaluation of the algorithms for vector bin packing
    Mommessin, Clement
    Erlebach, Thomas
    Shakhlevich, Natalia V.
    COMPUTERS & OPERATIONS RESEARCH, 2025, 173