SHELF ALGORITHMS FOR TWO-DIMENSIONAL PACKING PROBLEMS

被引:97
作者
BAKER, BS [1 ]
SCHWARZ, JS [1 ]
机构
[1] BELL TEL LABS INC,WHIPPANY,NJ 07981
关键词
D O I
10.1137/0212033
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:508 / 525
页数:18
相关论文
共 12 条
[1]  
Aho A.V., 1973, FIBONACCI QUART, V11, P429
[2]   ORTHOGONAL PACKINGS IN 2 DIMENSIONS [J].
BAKER, BS ;
COFFMAN, EG ;
RIVEST, RL .
SIAM JOURNAL ON COMPUTING, 1980, 9 (04) :846-855
[3]   A TIGHT ASYMPTOTIC BOUND FOR NEXT-FIT-DECREASING BIN-PACKING [J].
BAKER, BS ;
COFFMAN, EG .
SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1981, 2 (02) :147-152
[4]   A 5-4 ALGORITHM FOR TWO-DIMENSIONAL PACKING [J].
BAKER, BS ;
BROWN, DJ ;
KATSEFF, HP .
JOURNAL OF ALGORITHMS, 1981, 2 (04) :348-368
[5]  
BAKER BS, UNPUB J ALGORITHMS
[6]  
BROWN DJ, 1979, ACT19 U ILL COORD SC
[7]  
COFFMAN EG, 1980, SIAM J COMPUT, V9, P808, DOI 10.1137/0209062
[8]  
Garey M. R., 1975, SIAM Journal on Computing, V4, P187, DOI 10.1137/0204015
[9]   RESOURCE CONSTRAINED SCHEDULING AS GENERALIZED BIN PACKING [J].
GAREY, MR ;
GRAHAM, RL ;
JOHNSON, DS ;
YAO, ACC .
JOURNAL OF COMBINATORIAL THEORY SERIES A, 1976, 21 (03) :257-298
[10]  
GOLAN I, 1978, ORTHOGONAL ORIENTED