VARIABLE SIZED BIN PACKING

被引：145

作者：

FRIESEN, DK ^{[1
]}

LANGSTON, MA ^{[1
]}

机构：

[1] WASHINGTON STATE UNIV,DEPT COMP SCI,PULLMAN,WA 99164

来源：

SIAM JOURNAL ON COMPUTING | 1986年 / 15卷 / 01期

关键词：

D O I：

10.1137/0215016

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：222 / 230

页数：9

共 13 条

[1]

ASSMANN SF, UNPUB J ALGORITHMS

[2] ORTHOGONAL PACKINGS IN 2 DIMENSIONS [J].

BAKER, BS ;

COFFMAN, EG ;

RIVEST, RL .

SIAM JOURNAL ON COMPUTING, 1980, 9 (04) :846-855

[3]

BROWN DJ, 1979, CSL R864 U ILL TECH

[4]

COFFMAN EG, UNPUB APPROXIMATION

[5]

COFFMAN EG, 1982, DETERMINISTIC STOCHA, P245

[6] BOUNDS FOR MULTIFIT SCHEDULING ON UNIFORM PROCESSORS [J].

FRIESEN, DK ;

LANGSTON, MA .

SIAM JOURNAL ON COMPUTING, 1983, 12 (01) :60-70

[7] A STORAGE-SIZE SELECTION PROBLEM [J].

FRIESEN, DK ;

LANGSTON, MA .

INFORMATION PROCESSING LETTERS, 1984, 18 (05) :295-296

[8] A LINEAR-PROGRAMMING APPROACH TO THE CUTTING-STOCK PROBLEM [J].

GILMORE, PC ;

GOMORY, RE .

OPERATIONS RESEARCH, 1961, 9 (06) :849-859

[9]

Johnson D. S., 1974, SIAM Journal on Computing, V3, P299, DOI 10.1137/0203025

[10] FAST ALGORITHMS FOR BIN PACKING [J].

JOHNSON, DS .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1974, 8 (03) :272-314

← 1 2 →