MULTIDIMENSIONAL BIN PACKING ALGORITHMS

被引：46

作者：

KOU, LT ^{[1
]}

MARKOWSKY, G ^{[1
]}

机构：

[1] IBM CORP,THOMAS J WATSON RES CTR,DIV RES,YORKTOWN HTS,NY 10598

来源：

关键词：

D O I：

10.1147/rd.215.0443

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：443 / 448

页数：6

共 13 条

[1]

[Anonymous], 1971, STOC 71, DOI DOI 10.1145/800157.805047

[2]

BROWN AR, 1971, OPTIMUM PACKING DELE

[3]

CHANG SK, 1974, RC4954 IBM TJ WATS R

[4]

Conway R, 1967, THEORY SCHEDULING

[5] LOADING PROBLEM [J].

EILON, S ;

CHRISTOF.N .

MANAGEMENT SCIENCE SERIES A-THEORY, 1971, 17 (05) :259-268

[6]

Garey M. R., 1975, SIAM Journal on Computing, V4, P187, DOI 10.1137/0204015

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

GILMORE, PC ;

GOMORY, RE .

[8]

GRAHAM RL, 1972, AFIPS C P, V40, P205

[9]

Johnson D., 1973, THESIS MASSACHUSETTS

[10]

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