SOLUTION OF VALUE-INDEPENDENT KNAPSACK PROBLEM BY PARTITIONING

被引:11
作者
FAALAND, B [1 ]
机构
[1] UNIV WASHING,SEATTLE,WA 98105
关键词
D O I
10.1287/opre.21.1.332
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:332 / 337
页数:6
相关论文
共 12 条
[1]  
Bradley G. H., 1971, Discrete Mathematics, V1, P29, DOI 10.1016/0012-365X(71)90005-7
[2]   AN ENUMERATION ALGORITHM FOR KNAPSACK PROBLEMS [J].
CABOT, AV .
OPERATIONS RESEARCH, 1970, 18 (02) :306-&
[3]  
Faaland B, 1972, J COMBINATORIAL THEO, V13, P170
[4]   THEORY AND COMPUTATION OF KNAPSACK FUNCTIONS [J].
GILMORE, PC ;
GOMORY, RE .
OPERATIONS RESEARCH, 1966, 14 (06) :1045-&
[5]   A LINEAR-PROGRAMMING APPROACH TO THE CUTTING-STOCK PROBLEM [J].
GILMORE, PC ;
GOMORY, RE .
OPERATIONS RESEARCH, 1961, 9 (06) :849-859
[6]   MULTISTAGE CUTTING STOCK PROBLEMS OF 2 AND MORE DIMENSIONS [J].
GILMORE, PC ;
GOMORY, RE .
OPERATIONS RESEARCH, 1965, 13 (01) :94-&
[7]   A LINEAR-PROGRAMMING APPROACH TO THE CUTTING STOCK PROBLEM .2. [J].
GILMORE, PC ;
GOMORY, RE .
OPERATIONS RESEARCH, 1963, 11 (06) :863-888
[8]  
GLOVER F, 1970, 704 U COL MAN SCIENC
[9]   PARTITIONS - A SURVEY [J].
GUPTA, H .
JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICAL SCIENCES, 1970, B 74 (01) :1-+
[10]  
Mathews G. B., 1896, P LOND MATH SOC, V28, P486